System and methods of nonuniform data sampling and data reconstruction in shift invariant and wavelet spaces

ABSTRACT

A system and methods for converting data for an object of interest, which is characterized by a function ƒ, between a digital form and an analog form. In one embodiment, the method includes the steps of locally selecting a plurality of data sample points in the order of N, N being an integer, wherein the data sample points are in a first form of data type, performing a transformation in a shift invariant space to the locally selected data sample points to obtain a new data set that is in a second form of data type different from the first form of data type, and reconstructing the object of interest ƒ from the new data set. In one embodiment, the first form of data type is one of the the digital form and the analog form, and the second form of data type is one of the digital form and the analog form that is different from the first form of data type. In other words, the first form of data type can be in digital form, and the corresponding second form of data type is in analog form, and vice versa.

CROSS-REFERENCE TO RELATED APPLICATION

This application claims priority to U.S. Provisional Application Ser. No. 60/389,852, which was filed on Jun. 18, 2002, in the United States Patent and Trademark Office, and is hereby incorporated herein by reference in its entirety.

The present invention was made with Government support through a grant awarded by National Science Foundation. The United States Government may have certain rights to this invention pursuant to the grant.

Some references, which may include patents, patent applications and various publications, are cited in a reference list and discussed in the description of this invention. The citation and/or discussion of such references is provided merely to clarify the description of the present invention and is not an admission that any such reference is “prior art” to the invention described herein. All references cited and discussed in this specification are incorporated herein by reference in their entireties and to the same extent as if each reference was individually incorporated by reference. In terms of notation, hereinafter, “[n]” represents the nth reference cited in the reference list. For example, [5] represents the 5th reference cited in the reference list, namely, Aldroubi and Grochenig, Nonuniform sampling and reconstruction in shift-invariant spaces, SIAM Rev. 43 (2001), No. 4, 585-620.

FIELD OF THE INVENTION

The present invention generally relates to a system and methods for data representation of an object of interest. More particularly, the present invention relates to a system and methods for data representation of an object of interest through nonuniform data sampling and data reconstruction in shift-invariant and wavelet spaces.

BACKGROUND OF THE INVENTION

Any object of interest in the world can be represented by corresponding information, or data. Information or data can then be processed so that people may have access to it. As known to people skilled in the art and as used in the specification throughout, among other things, the term data generally refers to numerical, graphical or alphabetical information representing one or more objects of interest. Data may be obtained or reduced through empirical observations or from instrument readings. The term data processing generally refers to various operations on data. In particular, among other functions, data processing includes data recording, transmission of data, manipulation of data, data conversion, data reporting, data reconstruction, storage of data, retrieval of data, and usage of data.

One aspect of data processing relates to digital data processing. Modern digital data processing of functions (or signals or images) always uses a discretized version of the original signal ƒ that is obtained by sampling ƒ on a discrete set. The question then arises whether and how ƒ can be recovered from its samples, which often is termed as “sampling problem”. Therefore, among other things, one objective of research on the sampling problem is to quantify the conditions under which it is possible to recover particular classes of functions from different sets of discrete samples, and a related objective is to use these analytical results to develop explicit reconstruction schemes for the analysis and processing of digital data. Specifically, the sampling problem often includes two main parts as follows:

-   -   (a) First, given a class of functions V on         ^(d), find conditions on sampling sets X={x_(j)ε         ^(d):jεJ}, where J is a countable index set, under which a         function ƒεV can be reconstructed uniquely and stably from its         samples {ƒ(x_(j)):x_(j)εX)}; and     -   (b) Second, find efficient and fast numerical algorithms that         recover any function ƒεV from its samples on X.

In some applications, it may be justified to assume that the sampling set X={x_(j):jεJ} is uniform, i.e., that X forms a regular n-dimensional Cartesian grid, where n is an integer greater than zero. For examples, as shown in FIG. 1, curve 101 representing a function ƒ is sampled on a one-dimensional uniform grid 103. Moreover, as shown in FIG. 2, grid 203 represents a two-dimensional Cartesian grid. These grids can find some uses in real world and can be used to practice the present invention. For example, a digital image is often acquired by sampling light intensities on a uniform grid. Data acquisition requirements and the ability to process and reconstruct the data simply and efficiently often justify this type of uniform data collection.

However, in many realistic situations the data are known only on a nonuniformly spaced sampling set. This nonuniformity is a fact of life and prevents the use of the standard methods from Fourier analysis. Correspondingly, several nonuniform grids, such as a polar sampling grid 213, a spiral sampling grid 223, and a nonuniform grid 233, all schematically shown in FIG. 2, can find some more uses in real world and can be used to practice the present invention. The following examples are typical and indicate that nonuniform sampling problems are more pervasive in science and engineering.

Communication theory and practice: When data from a uniformly sampled signal (function) are lost, the result is generally a sequence of nonuniform samples. This scenario is usually referred to as a missing data problem. Often, missing samples are due to the partial destruction of storage devices, e.g., scratches on a CD. As shown in FIG. 3, a missing data problem is simulated by randomly removing samples from a slice of a three-dimensional magnetic resonance (MR) digital image 301. The simulated image 303 with 50% random missing samples displays a rather incomplete construction of image 301 and loses important details of image 301. Image 303 can be considered as a sampling of image 301, which is the object of interest at this example, on the nonuniform grid 233.

Astronomical measurements: The measurement of star luminosity gives rise to extremely nonuniformly sampled time series. Daylight periods and adverse nighttime weather conditions prevent regular data collection as further discussed in [111].

Medical imaging: Computerized tomography (CT) and magnetic resonance imaging (MRI) frequently use the nonuniform polar sampling grid 213 and spiral sampling grid 223 as further discussed in [21, 90], respectively.

Other applications using nonuniform sampling sets occur in geophysics as further discussed in [92], spectroscopy as further discussed in [101], general signal/image processing as further discussed in [13, 22, 103, 106], and biomedical imaging such as MRI as discussed above in connection with images 301 and 303 and ultrasonic images 401 and 403 as shown in FIG. 4 and as further discussed in [20, 59, 90, 101], respectively. For examples, as shown in FIG. 4, detected edge points 402 of the left ventricle of a heart from a two-dimensional ultrasound image 401 constitute a nonuniform sampling of the left ventricle's contour, while boundary 404 of the left ventricle shown is reconstructed from the detected edge sample points 402. More information about modern techniques for nonuniform sampling and applications can be found in [16].

Efforts have been made accordingly to find better, fast and efficient techniques for nonuniform data sampling and data reconstruction such that one can reconstruct an object of interest from nonuniform data sampling with limit data points, and/or can convert from digital type (i.e., some data points) to analog type (i.e., a corresponding image), or vice versa.

However, among other things, standard methods of signal processing and data sampling encounter several problems as follows:

First, these methods often are not local due to the infinite range of the band limited function model utilized by these methods.

Second, these methods are not multi-dimensional, i.e., they do not work well for signals related to time series, images, 3-D images, spectral images as well as samples of any high dimensional images with dimension larger than 3.

Third, these methods are normally not that fast. In fact, standard methods based on Fast Fourier Transformation (“FFT”) are currently fastest methods one can get. Still, in an ideal situation, it has an order of a computational complexity NlogN that is slow when N is large, where N is the order of the samples.

Fourth, these methods may not be easily utilized in association with parallel processing because the non-localization due to the infinite range of the band limited function model utilized by these methods, which further limits the ability of these methods to take advantages of computing power offered by parallel processing.

Therefore, there is a need to develop system and methods for nonuniform sampling and applications of data representing an object to address the aforementioned deficiencies and inadequacies.

SUMMARY OF THE INVENTION

The present invention overcomes the disadvantages of the prior art and relates to new approaches to sampling, converting and processing data. Specifically, the present invention relates to system and methods of sampling and reconstruction of data from a data set that contains information regarding one or more objects of interest. Moreover, the present invention relates to system and methods of converting data between a digital form and an analog form for a data set that contains information regarding one or more objects of interest.

In one aspect, the present invention relates to a method for sampling data for an object of interest, which is characterized by a functions, from a data set {ƒ(x_(j))}obtained from data sample points x_(j)ε[M₀, M₁], j being an indexing number, [M₀, M₁] representing an interval where the function ƒ is sampled, comprising the steps of:

-   -   a. constructing a first matrix         =         ^(M) ⁰ ^(M) ¹ , with matrix elements in the form of         _(jk)=φx_(j)−k), wherein φ is a continuous function with compact         support of size S, S being an integer, j being an integer from 1         to J, J being an integer ≧M₁−M₀+2S−1, and k being an integer         from M₀−S+1 to M₁+S−1;     -   b. obtaining a second matrix         =         ^(M) ⁰ ^(, M) ¹ =         *         , with matrix elements in the form of

kl = ∑ j = 1 J ⁢ φ ⁡ ( x j - k ) _ ⁢ φ ⁡ ( x j - l ) , wherein each of k, l is an integer from M₀−S+1 to M₁+S−1;

-   -   c. obtaining a first vector b=         *y with vector elements in the form of

$b_{k} = {\sum\limits_{j = 1}^{J}{\overset{\_}{\varphi\left( {x_{j} - k} \right)}y_{j}}}$ for k=M₀−S+1, . . . ,M₁+S−1, wherein y=(y₁, . . . , y_(j)) is a sampling vector;

-   -   d. solving a plurality of equations in the form of c=         ^(l)b to obtain a second vector c=(c_(k)), wherein k is an         integer from M₀−S+1 to M₁+S−1;     -   e. computing the restriction of the function ƒ to [M₀,M₁] to         obtain a new data set, ƒ(x), in the form of

${{f(x)} = {{\sum\limits_{k = {M_{0} - S + 1}}^{M_{1} + S - 1}{c_{k}{\varphi\left( {x - k} \right)}\mspace{14mu}{for}\mspace{14mu} x}} \in \left\lbrack {M_{0},M_{1}} \right\rbrack}};{and}$

-   -   f. reconstructing the object of interest ƒ from the new data         set.

In one embodiment, the step of reconstructing the object of interest ƒ from the new data set comprises the step of obtaining the object of interest ƒ as the least square approximation of the sampling vector y from

${{\sum\limits_{j = 1}^{J}{{y_{j} - {f\left( x_{j} \right)}}}^{2}} = {\min\limits_{h \in \;{V{(\varphi)}}}{\sum\limits_{j = 1}^{J}{{y_{j} - {h\left( x_{j} \right)}}}^{2}}}},$ wherein V(φ) represents a shift-invariant space. When y arises as the sampling vector, y={ƒ(x_(j))}, an exact reconstruction of ƒ is obtained from the new data set.

In another aspect, the present invention relates to a system for sampling data for an object of interest, which is characterized by a function ƒ, from a data set {ƒ(x_(j))} obtained from data sample points x_(j)ε[M₀, M₁], j being an indexing number, [M₀, M₁] representing an interval where the function ƒ is sampled, comprising a processor, wherein the processor is capable of performing the steps of:

-   -   a. constructing a first matrix         =         ^(M) ⁰ ^(,M) ¹ with matrix elements in the form of         _(jk)=φ(x_(j)—k), wherein φ is a continuous function with         compact support of size S, S being an integer, j being an         integer from 1 to J, J being an integer ≧M₁−M₀+2S−1, and k being         an integer from M₀−S+1 to M₁+S−1;     -   b. obtaining a second matrix         =         ^(M) ⁰ ^(,M) ¹ =         *         with matrix elements in the form of

kl = ∑ j = 1 J ⁢ φ ⁡ ( x j - k ) _ ⁢ φ ⁡ ( x j - l ) , wherein each of k, l is an integer from M₀−S+1 to M₁+S−1;

-   -   c. obtaining a first vector b=         *y with vector elements in the form of

$b_{k} = {\sum\limits_{j = 1}^{J}{\overset{\_}{\varphi\left( {x_{j} - k} \right)}y_{j}}}$ for k=M₀−S+1, . . . ,M₁+S−1, wherein y=(y₁, . . . , y_(j)) is a sampling vector;

-   -   d. solving a plurality of equations in the form of c=         ¹b to obtain a second vector c=(c_(k)), wherein k is an integer         from M₀−S+1 to M₁+S−1;     -   e. computing the restriction of the function ƒ to [M₀,M₁] to         obtain a new data set, ƒ(x), in the form of

${{f(x)} = {{\sum\limits_{k = {M_{0} - S + 1}}^{M_{1} + S - 1}{c_{k}{\varphi\left( {x - k} \right)}\mspace{14mu}{for}\mspace{14mu} x}} \in \left\lbrack {M_{0},M_{1}} \right\rbrack}};{and}$

-   -   f. reconstructing the object of interest ƒ from the new data         set.

In yet another aspect, the present invention relates to a method for converting data for an object of interest, which is characterized by a functions between a digital form and an analog form, comprising the steps of:

-   -   a. locally selecting a plurality of data sample points in the         order of N, N being an integer, wherein the data sample points         are in a first form of data type;     -   b. performing a transformation in a shift-invariant space to the         locally selected data sample points to obtain a new data set         that is in a second form of data type different from the first         form of data type; and     -   c. reconstructing the object of interest ƒ from the new data         set.

In one embodiment, the first form of data type is one of the digital form and the analog form, and the second form of data type is one of the digital form and the analog form that is different from the first form of data type. In other words, the first form of data type can be in digital form, and the corresponding second form of data type is in analog form, and vice versa. Alternatively, the present invention can be practiced to convert data from digital form to digital form, or from analog form to analog form.

Furthermore, the step of locally selecting a plurality of data sample points comprises the step of obtaining a data set {ƒ(x_(j))} from data sample points x_(j)ε[M₀, M₁], j being an indexing number up to the order of N, [M₀, M₁] representing an interval where the function ƒ is sampled.

Moreover, the step of performing a transformation in a shift-invariant space comprises the steps of:

-   -   a. constructing a first matrix         =         ^(M) ⁰ ^(,M) ² with matrix elements in the form of         _(jk)=φ(x_(j)−k), wherein φ is a continuous function with         compact support of size S, S being an integer, j being an         integer from 1 to J, J being an integer ≧M₁−M₀+2S−1, and k being         an integer from M₀−S+1 to M₁+S−1;     -   b. obtaining a second matrix         =         ^(M) ⁰ ^(,M) ¹ =         *         with matrix elements in the form of

kl = ∑ j = 1 J ⁢ φ ⁡ ( x j - k ) _ ⁢ φ ⁡ ( x j - l ) , wherein each of k, l is an integer from M₀−S+1 to M₁+S−1;

-   -   c. obtaining a first vector b=         * y with vector elements in the form of

$b_{k} = {\sum\limits_{j = 1}^{J}{\overset{\_}{\varphi\left( {x_{j} - k} \right)}y_{j}}}$ for k=M₀−S+1, . . . ,M₁+S−1, wherein y=(y₁, . . . , y_(j)) is a sampling vector;

-   -   d. solving a plurality of equations in the form of c=         b to obtain a second vector c=(c_(k)), wherein k is an integer         from M₀−S+1 to M₁+S−1; and     -   e. computing the restriction of the function ƒ to [M₀, M₁] to         obtain the new data set, ƒ(x), in the form of

${f(x)} = {{\sum\limits_{k = {M_{0} - S + 1}}^{M_{1} + S - 1}{c_{k}{\varphi\left( {x - k} \right)}\mspace{14mu}{for}\mspace{14mu} x}} \in {\left\lbrack {M_{0},M_{1}} \right\rbrack.}}$

Additionally, the step of reconstructing the object of interest ƒ from the new data set comprises the step of obtaining the object of interest ƒ as the least square approximation of the sampling vector y from

${{\sum\limits_{j = 1}^{J}{{y_{j} - {f\left( x_{j} \right)}}}^{2}} = {\min\limits_{h \in {V{(\varphi)}}}\;{\sum\limits_{j = 1}^{J}{{y_{j} - {h\left( x_{j} \right)}}}^{2}}}},$ wherein V(φ) represents the shift-invariant space.

In a further aspect, the present invention relates to a system for converting data for an object of interest, which is characterized by a functions between a digital form and an analog form, comprising a processor, wherein the processor is capable of performing the steps of:

-   -   a. locally selecting a plurality of data sample points in the         order of N, N being an integer, wherein the data sample points         are in a first form of data type;     -   b. performing a transformation in a shift-invariant space to the         locally selected data sample points to obtain a new data set         that is in a second type of data type different from the first         form of data type; and     -   c. reconstructing the object of interest ƒ from the new data         set.

In one aspect, the present invention relates to a method for recovering information about an object of interest ƒ from a data set {ƒ(x_(j))} obtained from nonuniform data sample points x_(j)εX, j being an indexing number, X representing the set of points where the object of interest ƒ has been sampled, comprising the steps of:

-   -   a. selecting data ƒ(x_(j)) from the data set {ƒ(x_(j))};     -   b. constructing an approximation operator Q_(X);     -   c. applying the approximation operator Q_(X) to the data         ƒ(x_(j)) to obtain an approximation Q_(X)ƒ(x_(j));     -   d. constructing a projection operator P;     -   e. applying the projection operator P to the approximation         Q_(X)ƒ(x_(j)) to obtain a first approximation ƒ₁=P         Q_(X)ƒ(x_(j));     -   f. obtaining an error e=ƒ(x_(j))−ƒ₁;     -   g. applying the projection operator P to the error e to obtain a         first approximation of error e₁=P e;     -   h. obtaining a second approximation ƒ₂=ƒ₁+e₁; and     -   i. returning to step (e) until a sequence ƒ_(n)=ƒ₁+e₁+e₂+e₃+ . .         . +e_(n−1) is obtained, wherein function ƒ_(n) converges to the         object of interest ƒ.

Another aspect of the present invention relates to a system for recovering information about an object of interest ƒ from a data set {ƒ(x_(j))} obtained from nonuniform data sample points x_(j)εX, j being an indexing number, X representing the set of points where the object of interest ƒ has been sampled. In one embodiment, the system has an input device for receiving the information in the data set {ƒ(x_(j))}, and a processing unit communicating to the input device and performing the steps of:

-   -   a. selecting data ƒ(x_(j)) from the data set {ƒ(x_(j))};     -   b. constructing an approximation operator Q_(X);     -   c. applying the approximation operator Q_(X) to the data         ƒ(x_(j)) to obtain an approximation Q_(X)ƒ(x_(j));     -   d. constructing a projection operator P;     -   e. applying the projection operator P to the approximation         Q_(X)ƒ(x_(j)) to obtain a first approximation ƒ₁=P         Q_(X)ƒ(x_(j));     -   f. obtaining an error e=ƒ(x_(j))−ƒ₁;     -   g. applying the projection operator P to the error e to obtain a         first approximation of error e₁=P e;     -   h. obtaining a second approximations ƒ₂=ƒ₁+e₁; and     -   i. returning to step (e) until a sequence ƒ_(n)=ƒ₁+e₁+e₂+e₃+ . .         . +e_(n−1) is obtained, wherein function ƒ_(n) converges to the         object of interest ƒ.

A further aspect of the present invention relates to a method for recovering information about an object of interest ƒ from a data set {ƒ(x_(j)))} obtained from nonuniform data sample points x_(j)εX, j being an indexing number, X representing the set of points where the object of interest ƒ has been sampled in presence of noise. Practicing the present invention in one embodiment includes the steps of:

-   -   a. selecting data ƒ_(j)′ from the data set         {ƒ_(j)′=ƒ(x_(j))+η_(j)}, wherein η_(j) represents a         corresponding noise component;     -   b. constructing an initialization functions as the summation of         function ƒ_(j)′: ƒ′=Σ_(jεJ)ƒ_(j)′β_(j), wherein β_(j) represents         the jth component of a partition of unity;     -   c. constructing an approximation operator Q_(X);     -   d. applying the approximation operator Q_(X) to the function ƒ′         to obtain an approximation Q_(X)ƒ′;     -   e. constructing a projection operator P;     -   f. applying the projection operator P to the approximation         Q_(X)ƒ′ to obtain a first approximation ƒ₁=P Q_(X)ƒ′;     -   g. obtaining an error e=f−ƒ₁;     -   h. applying the projection operator P to the error e to obtain a         first approximation of error e₁=P e;     -   i. obtaining a second approximation ƒ₂=ƒ₁+e₁; and     -   j. returning to step (f) until a sequence ƒ_(n)=ƒ₁+e₁+e₂+e₃+ . .         . +e_(n−1) is obtained, wherein function ƒ_(n) converges to a         function ƒ_(∞)that adequately describes the object of interests

Another further aspect of the present invention relates to system for recovering information about an object of interest ƒ from a data set {ƒ(x_(j))} obtained from nonuniform data sample points x_(j)ε:X, j being an indexing number, X representing the set of points where the object of interest ƒ has been sampled in presence of noise. In one embodiment, the system has an input device for receiving the information in the data set {ƒ(x_(j))}, and a processing unit coupled to and communicating to the input device and performing the steps of:

-   -   a. selecting data ƒ_(j)′ from the data set         {ƒ_(j)′=ƒ(x_(j))+σ_(j)}, wherein η_(j) represents a         corresponding noise component;     -   b. constructing an initialization function ƒ′ as the summation         of function ƒ_(j)′: ƒ′=Σ_(jεJ)ƒ_(j)′β_(j), wherein β_(j)         represents the jth component of a partition of unity;     -   c. constructing an approximation operator Q_(X);     -   d. applying the approximation operator Q_(X) to the function ƒ′         to obtain an approximation Q_(X)ƒ′;     -   e. constructing a projection operator P;     -   f. applying the projection operator P to the approximation         Q_(X)ƒ′ to obtain a first approximation ƒ₁=P Q_(X)ƒ′;     -   g. obtaining an error e=ƒ−ƒ₁;     -   h. applying the projection operator P to the error e to obtain a         first approximation of error e₁=P e;     -   i. obtaining a second approximation ƒ₂=ƒ₁+e₁; and     -   j. returning to step (f) until a sequence ƒ_(n)=ƒ₁+e₁+e₂+e₃+ . .         . +e_(n−1) is obtained, wherein function ƒ_(n) converges to a         function ƒ_(∞) that adequately describes the object of interest         f.

In yet another aspect, the present invention relates to a method for recovering information about an object of interest ƒ from a data set {ƒ(x_(j))} obtained from nonuniform data sample points x_(j)εX, j being an indexing number, X representing the set of points where the object of interest ƒ has been sampled in presence of noise, comprising the steps of sampling a set of data samples from the data set {ƒ(x_(j))}, iteratively framing the sampled set of data samples until the sampled set of data samples converges to a new set of data samples that has a size significantly smaller than the data set {ƒ(x_(j))}, and reconstructing the object of interest ƒ from the new set of data samples.

In another aspect, the present invention relates to a system for recovering information about an object of interest ƒ from a data set {ƒ(x_(j))}obtained from nonuniform data sample points x_(j)εX, j being an indexing number, X representing the set of points where the object of interest ƒ has been sampled in presence of noise, comprising means for sampling a set of data samples from the data set {ƒ(x_(j))}, means for iteratively framing the sampled set of data samples until the sampled set of data samples converges to a new set of data samples that has a size significantly smaller than the data set {ƒ(x_(j))}, means for reconstructing the object of interest ƒ from the new set of data samples. In one embodiment, the sampling means comprises an input device, the framing means comprises a processor, and the reconstructing means comprises an output device.

In yet another aspect, the present invention relates to a method for recovering information about an object of interest ƒ from a data set of averages {<(ƒ, ψ_(x) _(j) >} obtained from nonuniform data sample points x_(j)εX, j being an indexing number, X representing the set of points where the object of interest ƒ has been sampled, comprising the steps of:

-   -   a. selecting data <ƒ, ψ_(x) _(j) > from the data set {<ƒ, ψ_(x)         _(j) >};     -   b. constructing a quasi-reconstruction operator Ax for obtaining         a quasi-reconstruction A_(X)ƒ, wherein A_(X)f=Σ_(jεj) <ƒ, ψ_(x)         _(j) >β_(j), wherein β_(j) represents the jth component of a         partition of unity, and {ψ_(x) _(j) :x_(j)εX} is a set of         functionals that act on ƒ;     -   c. constructing a projection operator P;     -   d. applying the projection operator P to the         quasi-reconstruction A_(x)ƒ to obtain a first approximation         ƒ₁=PA_(X)ƒ;     -   e. obtaining an error e=(ƒ−ƒ₁);     -   f. applying the projection operator P and the         quasi-reconstruction operator A_(X) to the error e to obtain a         first approximation of error e₁=P A_(X)e;     -   g. obtaining a second approximation ƒ₂=ƒ₁+e₁; and     -   h. returning to step (e) until a sequence f_(n)=ƒ₁+e₁+e₂+e₃+ . .         . +e_(n−1)=P A_(X)(ƒ−ƒ_(n−1))+ƒ_(n−1) is obtained, wherein         function ƒ_(n) converges to the object of interest ƒ.

Another aspect of the present invention relates to a system for recovering information about an object of interest ƒ from a data set of averages {<ƒ,ψ_(x) _(j) >} obtained from nonuniform data sample points x_(j)εX, j being an indexing number, X representing the set of points where the object of interest ƒ has been sampled. In one embodiment, the system has an input device for receiving the information in the data set {<ƒ,ψ_(x) _(j) >}, and a processor coupled to and communicating to the input device and performing the steps of:

-   -   a. selecting data <ƒ,ψ_(x) _(j) > from the data set {<ƒ,ψ_(x)         _(j) >};     -   b. constructing a quasi-reconstruction operator A_(X) for         obtaining a quasi-reconstruction A_(X)ƒ, wherein         A_(X)ƒ=Σ_(jεJ)<ƒ,ψ_(x) _(j) >β_(j), wherein β_(j) represents the         jth component of a partition of unity, and {ψ_(x) _(j) :x_(j)εX}         is a set of functionals that act on ƒ,     -   c. constructing a projection operator P;     -   d. applying the projection operator P to the         quasi-reconstruction A_(X)ƒ to obtain a first approximation         ƒ₁=PA_(X)ƒ;     -   e. obtaining an error e=ƒ−ƒ₁;     -   f. applying the projection operator P and the         quasi-reconstruction operator A_(X) to the error e to obtain a         first approximation of error e₁=P A_(X) e;     -   g. obtaining a second approximation ƒ₂=ƒ₁+e₁; and     -   h. returning to step (e) until a sequence ƒ_(n)=ƒ₁+e₁+e₂+e₃+ . .         . +e_(n−1)=P A_(X)(ƒ−ƒ_(n−1))+ƒ_(n−1) is obtained, wherein         function ƒ_(n) converges to the object of interest ƒ.

A further aspect of the present invention relates to a method for recovering information about an object of interest ƒ from a data set {<ƒ,ψ_(x) _(j) >} obtained from nonuniform data sample points x_(j)εX, j being an indexing number, X representing the set of points where the object of interest ƒ has been sampled in presence of noise. Practicing the present invention in one embodiment includes the steps of:

-   -   a. selecting data ƒ_(j)′ from the data set         {ƒ_(j)′=ƒ(x_(j))+η_(j)}, wherein η_(j) represents a         corresponding noise component;     -   b. constructing an initialization function ƒ′ as the summation         of function ƒ_(j)′: ƒ′=Σ_(jεJ)ƒ_(j)′β_(j), wherein β_(j)         represents the jth component of a partition of unity;     -   c. constructing a quasi-interpolant operator Q_(X);     -   d. applying the quasi-interpolant operator Q_(X) to the function         ƒ′ to obtain an approximation Q_(X)ƒ′;     -   e. constructing a projection operator P;     -   f. applying the projection operator P to the approximation         Q_(X)ƒ′ to obtain a first approximation ƒ₁=P Q_(X)ƒ′;     -   g. obtaining an error e=ƒ−ƒ₁;     -   h. constructing a quasi-reconstruction operator A_(X) for         obtaining a quasi-reconstruction A_(X)f, wherein         A_(X)ƒ=Σ_(jεJ)<ƒ,ψ_(x) _(j) >β_(j), and {ψ_(x) _(j) :x_(j)εX} is         a set of functionals that act on ƒ;     -   i. applying the projection operator P and the         quasi-reconstruction operator A_(X) to the error e to obtain a         first approximation of error e₁=PA_(X) e;     -   j. obtaining a second approximation ƒ₂=ƒ₁+e₁; and     -   k. returning to step (g) until a sequence ƒ_(n)=ƒ₁+e₁+e₂+e₃+ . .         . +e_(n−1)=ƒ₁+(I−P A_(X))ƒ_(n−1) is obtained, wherein I is an         unit operator and function ƒ_(n) converges to a function ƒ_(∞)         that adequately describes the object of interest ƒ.

A further aspect of the present invention relates to system for recovering information about an object of interest ƒ from a data set {<ƒ,ψ_(x) _(j) >} obtained from nonuniform data sample points x_(j)εX, j being an indexing number, X representing the set of points where the object of interest ƒ has been sampled in presence of noise. In one embodiment, the system has an input device for receiving the information in the data set {ƒ(x_(j))}, and a processor coupled to and communicating to the input device and performing the steps of:

-   -   a. selecting data ƒ_(j)′ from the data set {ƒ_(j)′=<ƒ,ψ_(x) _(j)         >+η_(j)}, wherein η_(j) represents a corresponding noise         component;     -   b. constructing an initialization function ƒ′ as the summation         of function ƒ_(j)′: ƒ′=Σ_(jεJ)ƒ_(j)′β_(j), wherein β_(j)         represents the jth component of a partition of unity;     -   c. constructing a quasi-interpolant operator Q_(X);     -   d. applying the quasi-interpolant operator Q_(X) to the         functions to obtain an approximation Q_(X)ƒ′;     -   e. constructing a projection operator P;     -   f. applying the projection operator P to the approximation         Q_(X)ƒ′ to obtain a first approximation ƒ₁=P Q_(X)ƒ′;     -   g. obtaining an error e=f−ƒ₁;     -   h. constructing a quasi-reconstruction operator A_(X) for         obtaining a quasi-reconstruction A_(X)ƒ wherein A_(X)ƒ=Σ_(jεJ)         <ƒ,ψ_(x) _(j) >β_(j), and {ψ_(x) _(j) :x_(j)εX} is a set of         functionals that act on ƒ;     -   i. applying the projection operator P and the         quasi-reconstruction operator A_(X) to the error e to obtain a         first approximation of error e₁=PA_(X) e;     -   j. obtaining a second approximation ƒ₂=ƒ₁+e₁; and

k. returning to step (g) until a sequence ƒ_(n)=ƒ₁+e₁+e₂+e₃+ . . . +e_(n−1)=ƒ₁+(I−P A_(X))ƒ_(n−1) is obtained, wherein I is an unit operator and function ƒ_(n) converges to a function ƒ_(∞) that adequately describes the object of interest ƒ.

In one embodiment, the approximation operator Q_(X) comprises an interpolation operator, wherein the interpolation operator provides piecewise linear interpolation. Alternatively, the approximation operator Q_(X) comprises a quasi-interpolation operator, wherein the quasi-interpolation operator provides step-wise approximation. The projection operator P comprises a bounded projection. Alternatively, the projection operator P comprises a universal projection.

The data set, being in the form of {ƒ(x_(j))}, {ƒ_(j)′=ƒ(x_(j))+η_(j)}, {<ƒ,ψ_(x) _(j) >}, or {ƒ_(j)′=<ƒ,ψ_(x) _(j) >+η_(j)}, can comprise a variety of types of data in a first form of analog data type or in a second form of digital data type, or vice versa. Each type of data can comprise a variety of kinds of data in terms of substance. For examples, the data set can comprise a plurality of digital data related to sound including communications between person to person, person to machine, machine to machine including, but not limited to, data collected for commercial purpose, educational purpose, intelligence purpose, national security purpose, etc. The data set can also comprise a plurality of digital data related to at least one image, wherein the at least one image is one of a plurality of magnetic resonance image, a plurality of computerized tomography images, a plurality of optical image, a plurality of ultra sound images, a plurality of electronic images that are transmittable over a network, a plurality of satellite images, a plurality of three-dimensional images, a plurality of spectral images, a plurality of n-dimensional images with n being an integer greater than 1, any combination of them, or the like. Moreover, the data set can comprise a plurality of biological data, wherein the plurality of biological data contain a plurality of data from the group of a plurality of biological data related to genes, a plurality of biological data related to proteins, a plurality of biological data related to cells, a plurality of biological data related to bacteria, or a plurality of biological data related to tissues, any combination of them, or the like. Furthermore, the data set can comprise a plurality of data from at least one measurement of the object of the interest, wherein the at least one measurement is one of at least one astronomical measurement, at least one seismic measurement, at least one marine measurement, at least one geophysical measurement, at least one atmospheric measurement, at least one engineering measurement, at least one physical measurement, or at least one chemical measurement, any combination of them, or the like. Additionally, the data set can comprise a plurality of data that are static, a plurality of data related to time dependent signals, any combination of them, or the like.

In one embodiment, the processor comprises a microprocessor. The system further has an input device coupled to and in communication with the processor, wherein the input device comprises at least one device selected from the group of a processor interface, a GUI, a scanner, a CD-ROM, a diskette, a computer coupled to a network, and a networking device. Moreover, the system further has an output device coupled to and in communication with the processor, wherein the output device comprises at least one device selected from the group of a GUI, a printer, a CD-ROM, a diskette, a memory device, a computer coupled to a network, and a networking device.

For the purpose of practicing the present invention, an object of interest can be any subject under the sun in which human being is interested, which includes human being himself or herself and any and all human being activities.

Other advantages and uses for the present invention will be more clearly understood by reference to the remainder of this document.

The present invention overcomes the disadvantages of the prior art and relates to new approaches to sampling, converting and processing data. Specifically, the present invention relates to system and methods of sampling and reconstruction of data from a data set that contains information regarding one or more objects of interest. Moreover, the present invention relates to system and methods of converting data between a digital form and an analog form for a data set that contains information regarding one or more objects of interest.

Many more applications can be found for these and other aspects of the present invention. For examples, among other things and advantages, the methods and related algorithms of the present invention are local, i.e., the reconstruction of the data or signal of an object of interest depends only on the given data in the neighborhood of each sampling point as opposed to the infinite range of the band limited function model of the prior art.

Second, the methods and related algorithms of the present invention are multi-dimensional, which make them suitable for signals, time series, images, 3-D images, spectral images as well as samples of any high dimensional images with dimension larger than n, n being an integer greater than 1.

Third, the methods and related algorithms of the present invention are fast in the order of N with a computational complexity of order N, where N is about the number of samples. In other words, the number of operation needed for reconstruction is about and proportional to the number of samples. By contrast, as set forth above, standard methods based on FFT are of complexity NlogN. Consequently, the methods and related algorithms of the present invention are well adapted for processing large data sets in the fields of, for examples, medical image processing, geophysics, seismology, and oil exploration.

Fourth, localization of the methods and related algorithms of the present invention makes it as a great candidate in combination with data segmentation to facilitate parallel processing, thereby increasing speed of reconstruction.

Fifth, the methods and related algorithms of the present invention can be used to improve data conversion between digital form and analog form in many applications such as improving recovery of faults in a fault tolerant system rather than building heavily redundant systems, improving analysis/correction of outlier data points for reduction of noise, application in medical systems including computer x-ray tomography, magnetic resonance imaging, ultra-sound images, telemedicine such as remote specialist interpretation of medical images and the like, improving registration/synthesis of color separated images in printing processes and systems, enhancement of image or sound files recorded with older or inferior technologies including movies, early TV, early photographs, or the like, improving satellite imaging, applications in geophysics, seismology, oil exploration and the like.

Indeed, the methods and related algorithms of the present invention can be utilized to provide better, efficient, and fast data processing, data conversion, and data reconstruction for any and all fields where data for an object of interest are collected and need to be processed.

These and other aspects of the present invention will become apparent from the following description of the preferred embodiment taken in conjunction with the following drawings, although variations and modifications therein may be affected without departing from the spirit and scope of the novel concepts of the disclosure.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 schematically shows a typical sampling problem that can be solved by practicing the present invention. (a). A function ƒ defined on

, represented by curve 101, is sampled on a uniform grid 103. (b). The same function ƒ is sampled on a nonuniformly spaced grid 113. The sampling locations x_(j) are marked by the symbol x, and the sampled values ƒ(x_(j)) by a circle o.

FIG. 2 schematically shows several types of sampling grids that can be utilized to practice the present invention. Top left: A Cartesian sampling grid 203, which is used in signal and image processing whenever possible because its simplicity. Top right: A polar sampling grid 213, which is used, for example, in computerized tomography. In this case, the two-dimensional Fourier transform {circumflex over (ƒ)} (not shown) is sampled with the goal of reconstructing ƒ. Bottom left: A spiral sampling grid 223, which is used, for example, for fast MRI by direct signal reconstruction from spectral data on spirals. Bottom right: A typical nonuniform sampling grid 233, which can be used, for examples, in spectroscopy, astronomy, geophysics, and other signal and image processing applications.

FIG. 3 schematically shows a missing data problem that can be solved by practicing the present invention. Left: Original digital MRI image 301 with 128×128 samples. Right: MRI image 303 with 50% randomly missing samples.

FIG. 4 schematically shows sampling and boundary reconstruction from ultrasonic images that can be obtained by practicing the present invention. Left: Detected edge points 402 of the left ventricle of a heart from a two-dimensional ultrasound image 401 constituting a nonuniform sampling of the left ventricle's contour. Right: Boundary 404 of the left ventricle reconstructed from the detected edge sample points 402.

FIG. 5 schematically shows the iterative reconstruction algorithm according to one embodiment of the present invention.

FIG. 6 schematically shows reconstruction of a function ƒ with ∥ƒ∥₂=3.5 using the iteration algorithm as set forth in FIG. 5 according to one embodiment of the present invention. (a). Curve 601 representing function ƒ belonging to the shift-invariant space generated by the Gaussian function exp(−x²/σ²), σ≈0.81, and its sample values {ƒ(x_(j)), x_(j)εX} marked by + (density ε≈0.8). (b). Curve 611 representing error ∥ƒ−ƒ_(n)|_(L) ² against the number of iterations. (c). Curve 621 representing final error ƒ−ƒ_(n) after 10 iterations. (d). Curve 631 representing reconstructed function ƒ₁₀ (continuous line) and original samples {ƒ(x_(j)), x_(j)εX}.

FIG. 7 displays a missing data reconstruction performed according to one embodiment of the present invention. (a). Original digital MRI image 701 with 128×128 samples. (b). MRI image 703 with 50% randomly missing samples. (c). Reconstruction or image 711 using the iterative reconstruction algorithm according to one embodiment of the present invention. The corresponding shift invariant space is generated by φ(x, y)=β³(x)×β³(y), where β³=χ_([0, 1])*χ_([0, 1])*χ_([0, 1])*, χ_([0, 1]) is the B-spline function of degree 3.

FIG. 8 schematically shows reconstruction of a function ƒ with additive noise using the iteration algorithm as set forth in FIG. 5 according to one embodiment of the present invention. (a). Curve 801 representing function ƒ belonging to the shift-invariant space generated by the Gaussian function exp(−x²/σ²), σ=0.81. (b). Curve 811 representing function ƒ with an additive white noise (SNR≈0 db). (c). Curve 821 representing Noisy signal sampled on a nonuniform grid with maximal gap 0.51. (d). Curve 831 representing reconstructed function ƒ₁₀ after 10 iterations (continuous line) and original signal ƒ(dotted line) from curve 801.

FIG. 9 schematically shows a block-diagram of a system that can be utilized to practice the present invention.

FIG. 10 shows the shift-invariant spline spaces with the B-spline of order 3 with φ

[−2,2] and S=2 that can be utilized to practice the present invention.

FIG. 11 shows a curve 1101 as a plot of the operation count as a function of the number of sampling points.

FIG. 12 schematically shows reconstruction of a function ƒ with additive noise according to one embodiment of the present invention with a signal on the interval [0,128]. Since S=2, one needs at least M₁−M₀+2S−1=131 samples. The actual sampling set of FIG. 12 has 200 sample points as calculated and satisfies the maximum gap condition max_(j)(x_(j+1)−x_(j))≈0.67<1. (a). Curve 1201 representing original signal. (b). Curve 1211 representing original signal with noise. (c). Curve 1221 representing noisy signal sampled on a nonuniform grid. (d). Curve 1231 representing reconstructed original signal after 10 iterations (continuous line) in comparison with original signal dotted line from curve 1201.

FIG. 13A schematically shows the dependence of the reconstruction on the generator φ, where the generator φ is a B-spline of order N, i.e. φN=X_([−1/2,1/2]* . . . *[1/2,1/2]) (N+1-fold convolution). The data set (x_(j), y_(j))_(j=1, . . . , J) is generated by sampling a function ƒεV (φ₅) and then noise is added. The top left picture shows the original signal and the noisy sampled data. Then each subplot depicts the optimal approximation of these data in the spline space V (φ_(N)), N=0, . . . , 6, starting with an approximation by a step function ƒ_(rec)εV (φ₀) via an approximation by a piecewise linear function ƒ_(rec)εV(φ₁) and ending with a smooth approximation ƒ_(rec)εV (φ₆). (a). Curve 1301 representing the original signal and curve 1303 representing the corresponding noisy sampled data. (b). Curve 1311 representing the optimal approximation of the data as given in (a) in the spline space V_((φN)), N=0, starting with an approximation by a step function ƒ_(rec)εV (φ₀), i.e., N=0, in comparison with curve 1301 representing original signal with noise. (c). Same as (b) but with N=1. (d). Same as (b) but with N=2.

FIG. 13B schematically shows the dependence of the reconstruction on the generator φ, where the generator φ is a B-spline of order N, i.e. φN=X_([−1/2,1/2]* . . . *[1/2,1/2]) (N+1-fold convolution) same as FIG. 13A. (e). Same as (b) of FIG. 13A but with N=3. (f). Same as (e) but with N=4. (e). Same as (b) but with N=5. (e). Same as (e) but with N=6.

FIG. 14 schematically shows the associated banded matrix

of the linear system according to one embodiment of the present invention.

FIG. 15 schematically shows the power of the method of data segmentation according to one embodiment of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

Various embodiments of the invention are now described in detail. Referring to the drawings, like numbers indicate like parts throughout the views. As used in the description herein and throughout the claims that follow, the meaning of “a,” “an,” and “the” includes plural reference unless the context clearly dictates otherwise. Also, as used in the description herein and throughout the claims that follow, the meaning of “in” includes “in” and “on” unless the context clearly dictates otherwise.

The terms used in this specification generally have their ordinary meanings in the art, within the context of the invention, and in the specific context where each term is used. Certain terms that are used to describe the invention are discussed below, or elsewhere in the specification, to provide additional guidance to the practitioner in describing the compositions and methods of the invention and how to make and use them. For convenience, certain terms may be highlighted, for example using italics and/or quotation marks. The use of highlighting has no influence on the scope and meaning of a term; the scope and meaning of a term is the same, in the same context, whether or not it is highlighted. It will be appreciated that the same thing can be said in more than one way. Consequently, alternative language and synonyms may be used for any one or more of the terms discussed herein, nor is any special significance to be placed upon whether or not a term is elaborated or discussed herein. Synonyms for certain terms are provided. A recital of one or more synonyms does not exclude the use of other synonyms. The use of examples anywhere in this specification, including examples of any terms discussed herein, is illustrative only, and in no way limits the scope and meaning of the invention or of any exemplified term. Likewise, the invention is not limited to various embodiments given in this specification.

As used herein, “about” or “approximately” shall generally mean within 20 percent, preferably within 10 percent, and more preferably within 5 percent of a given value or range. Numerical quantities given herein are approximate, meaning that the term “about” or “approximately” can be inferred if not expressly stated.

Several embodiments are now described with reference to the FIGS. 1-15, in which like numbers indicate like parts throughout the FIGS. 1-15.

Overview of the Inventive System

In general, the present invention can be practiced in association with an inventive system 100 as shown in FIG. 9. In one embodiment, the system 100 includes a computer 8 having a host processor 12 with a display 14, such as a monitor, having a graphic-user interface (GUI) 20 displaying data for at least one peripheral device 10. The host processor 12 includes at least one microprocessor. The peripheral device 10 can be an input device to receive data or out put device for output data, shown here as a printer, in operative communication with the host processor 12. The printer 10 and host processor 12 can be in communication through any media, such as a direct wire connection 18 or through a network or the Internet 16. Even wireless communication between the printer 10 and host processor 12 can be used with the present invention as long as data can be exchanged between the printer 10 and host processor 12. The GUI 20 is generated by a GUI code as part of the operating system (O/S) of the host processor 12. As those skilled in the art will appreciate, the data to be processed in the system 100 can be stored in a memory device (not shown), can be imported from a device (not shown) in communication with the system 100, or can be provided in the form of a computer readable medium. Examples of computer readable media include: recordable type media such as floppy disks and CD-ROMs and transmission type media such as digital and analog communication links. Likewise, the result of processed data can be displayed in GUI 20, printed by printer 10, saved in a memory device (not shown), processed in another device, transmitted over network 16 or can be, provided in the form of the computer readable medium. Furthermore, the system 100 can be operated to practice the present invention with other data processing software such as Matlab© and Labview©.

Computer 8 can be a mainframe computer, a workstation, a desktop computer, a portable computer, any combination of them, or the like. Indeed, several computers 8 can be coupled together to form a local network for parallel processing. Or, computers 8 can communicate to each other through network 16 such as Internet for processing data according to one embodiment of the present invention.

The processing unit of each computer may comprise a processor such as host processor 12. The input device may include a microprocessor interface. The input device further may include at least one device selected from the group of a GUI, a scanner, a CD-ROM, a diskette, a computer coupled to a network, a networking device, any combination of them, or the like. Additionally, the system may further include an output device coupled to the processing unit, wherein the output device comprises at least one device selected from the group of a GUI, a printer, a CD-ROM, a diskette, a computer coupled to a network, a networking device, any combination of them, or the like.

Without intent to limit the scope of the invention, exemplary methods and their related results according to the embodiments of the present invention are given below. Note that titles or subtitles may be used in the examples for convenience of a reader, which in no way should limit the scope of the invention. Moreover, certain theories are proposed and disclosed herein; however, in no way they, whether they are right or wrong, should limit the scope of the invention so long as data are processed, sampled, converted, or the like according to the invention without regard for any particular theory or scheme of action.

EXAMPLES Example 1 A Unified Framework for Uniform and Nonuniform Data Sampling in Shift Invariant Spaces

Approach Overview

Modern digital data processing of functions (or signals or images) always uses a discretized version of the original signal ƒ that is obtained by sampling ƒ on a discrete set. The question then arises whether and how ƒ can be recovered from its samples.

In one aspect, the present invention relates to a method for recovering information about an object of interest ƒ from a data set {ƒ(x_(j))} obtained from uniform or nonuniform data sample points x_(j)εX, j being an indexing number, X representing the set of points where the object of interest ƒ has been sampled, wherein X may be perturbed by a noise, comprising the steps of sampling a set of data samples from the data set {ƒ(x_(j))}, iteratively framing the sampled set of data samples until the sampled set of data samples converges to a new set of data samples that has a size significantly smaller than the data set {ƒ(x_(j))}, and reconstructing the object of interest ƒ from the new set of data samples.

1. Relevant Concepts

Sampling in Paley-Wiener Spaces: Bandlimited Functions

Since infinitely many functions can have the same sampled values on X={x_(j)}_(jεJ)⊂

^(d), the sampling problem becomes meaningful only after imposing some a priori conditions on ƒ. The standard assumption is that the function ƒ on

^(d) belongs to the space of bandlimited functions B_(Ω); i.e., the Fourier transform

f̂(ξ) = ∫_(R^(d))f(x)𝕖^(−2 π 𝕚⟨ξ, x⟩)𝕕x of ƒ is such that {circumflex over (ƒ)} (ξ)=0 for all ξ∉Ω=[−ω, ω]^(d) for some ω<∞ (see, e.g., [15, 44, 47, 55, 62, 72, 78, 88, 51, 112] and the review papers [27, 61, 65]). The reason for this assumption is a classical result of Whittaker [114] in complex analysis which states that, for dimension d=1, a function ƒεL² (

)∩B_([−1/2,1/2]) can be recovered exactly from its samples {ƒ (k):kεZ} by the interpolation formula ƒ(x)=Σ_(kε)ƒ(k)sinc(x−k)  (1.1) where sinc (x)=sin πx/πx. This series gave rise to the uniform sampling theory of Shannon [96], which is fundamental in engineering and digital signal processing because it gives a framework for converting analog signals into sequences of numbers. These sequences can then be processed digitally and converted back to analog signals via (1.1).

Taking the Fourier transform of (1.1) and using the fact that the Fourier transform of the sinc function is the characteristic function χ_([−1/2,1/2]) shows that for any ξε[−½, ½]

${\hat{f}(\xi)} = {{\sum\limits_{k}^{\;}{{f(k)}{\mathbb{e}}^{2\pi\;{\mathbb{i}}\; k\;\xi}}} = {\sum\limits_{k}^{\;}{\left\langle {\hat{f},{\mathbb{e}}^{{\mathbb{i}2}\;\pi\; k}} \right\rangle_{L^{2}{({{{- 1}/2},{1/2}})}}{{\mathbb{e}}^{{\mathbb{i}}\; 2\pi\; k\;\xi}.}}}}$

Thus, reconstruction by means of the formula (1.1) is equivalent to the fact that the set {e^(i2πkξ), kεZ} forms an orthonormal basis of L² (−½, ½) called the harmonic Fourier basis. This equivalence between the harmonic Fourier basis and the reconstruction of a uniformly sampled bandlimited function has been extended to treat some special cases of nonuniformly sampled data. In particular, the results by Paley and Wiener [87], Kadec [71], and others on the nonharmonic Fourier bases {e^(i2πx) _(k) ^(ξ), kεZ} can be translated into results about nonuniform sampling and reconstruction of bandlimited functions [15, 62, 89, 94]. For example, Kadec's theorem [71] states that if X={xε

:|x_(k)−k|≦L<¼} for all kεZ, then the set {e^(i2πx) ^(k) ^(ξ), kεZ} is a Riesz basis of L² (−½, ½); i.e., {e^(i2πx) ^(k) ^(ξ), kεZ} is the image of an orthonormal basis of L² (−½, ½) under a bounded and invertible operator from L² (−½, ½) onto L² (−½, ½). Using Fourier transform methods, this result implies that any bandlimited function ƒεL²∩B_([−1/2, 1/2]) can be completely recovered from its samples {ƒ(x_(k)), kεZ}, as long as the sampling set is of the form X {x_(k)ε

:|x_(k)−k|<¼}_(kεZ).

The sampling set X={x_(k)ε

:|x_(k)−k|<¼}_(kεZ) in Kadec's theorem is just perturbation of Z. For more general sampling sets, the work of Beurling [23, 24], Landau [74], and others [18, 58] provides a deep understanding of the one-dimensional theory of nonuniform sampling of bandlimited functions. Specifically, for the exact and stable reconstruction of a bandlimited function ƒ from its samples {ƒ (x_(j)):x_(j)εX}, it is sufficient that the Beurling density

$\begin{matrix} {{D(X)} = {\lim\limits_{r\rightarrow\infty}\;{\inf\limits_{y \in R}\frac{{\# X}\bigcap\left( {y + \left\lbrack {0,r} \right\rbrack} \right)}{r}}}} & (1.2) \end{matrix}$ satisfies D (X)>1. Conversely, if ƒ is uniquely and stably determined by its samples on X⊂

, then D (X)≧1 [74]. The marginal case D (X)=1 is very complicated and is treated in [79, 89, 94].

It should be emphasized that these results deal with stable reconstructions. This means that an inequality of the form

${f}_{p} \leq {C\left( {\sum\limits_{x_{j} \in X}^{\;}{{f\left( x_{j} \right)}}^{p}} \right)}^{1/p}$ holds for all bandlimited functions ƒεL^(P)∩B_(Ω). A sampling set for which the reconstruction is stable in this sense is called a (stable) set of sampling. This terminology is used to contrast a set of sampling with the weaker notion of a set of uniqueness. X is a set of uniqueness for B_(Ω)if ƒ|_(x)=0 implies that ƒ=0. Whereas a set of sampling for B_([1/2, 1/2]) has a density D≧1, there are sets of uniqueness with arbitrarily small density. See [73, 25] for examples and characterizations of sets of uniqueness.

While the theorems of Paley and Wiener and Kadec about Riesz bases consisting of complex exponentials e^(i2πx) ^(k) ^(ξ) are equivalent to statements about sampling sets that are perturbations of Z, the results about arbitrary sets of sampling are connected to the more general notion of frames introduced by Duffin and Schaeffer [40]. The concept of frames generalizes the notion of orthogonal bases and Riesz bases in Hilbert spaces and of unconditional bases in some Banach spaces [2, 5, 6, 12, 14, 15, 20, 28, 29, 46, 66, 97].

Sampling in Shift-Invariant Spaces

The series (1.1) shows that the space of bandlimited functions B_([1/2, 1/2]) is identical with the space

$\begin{matrix} {{V^{2}\left( {\sin\; c} \right)} = {\left\{ {{\sum\limits_{k \in Z}^{\;}{c_{k}\sin\;{c\left( {x - k} \right)}}}:{\left( c_{k} \right) \in l^{2}}} \right\}.}} & (1.3) \end{matrix}$

Since the sinc function has infinite support and slow decay, the space of bandlimited functions is often unsuitable for numerical implementations. For instance, the pointwise evaluation

$\left. f\mapsto{f\left( x_{0} \right)} \right. = {\sum\limits_{k \in Z}^{\;}{c_{k}\sin\;{c\left( {x_{0} - k} \right)}}}$ is a nonlocal operation, because, as a consequence of the long-range behavior of sinc, many coefficients c_(k) will contribute to the value ƒ(x₀). In fact, all bandlimited functions have infinite support since they are analytic. Moreover, functions that are measured in applications tend to have frequency components that decay for high frequencies, but these functions are not bandlimited in the strict sense. Thus, it has been advantageous to use non-bandlimited models that retain some of the simplicity and structure of bandlimited models but are more amenable to numerical implementation and are more flexible for approximating real data [13, 63, 64, 86, 103, 104]. One such example are the shift-invariant spaces that are discussed in this specification.

A shift-invariant space is a space of functions on

^(d) of the form

${V\left( {\phi_{1},\ldots\;,\phi_{r}} \right)} = {\left\{ {\sum\limits_{i = 1}^{r}{\sum\limits_{j \in Z^{d}}^{\;}{c_{j}^{i}{\phi_{i}\left( {x - j} \right)}}}} \right\}.}$ Such spaces have been used in finite elements and approximation theory [34, 35, 67, 68, 69, 98] and for the construction of multiresolution approximations and wavelets [32, 33, 39, 53, 60, 70, 82, 83, 95, 98, 99, 100]. They have been extensively studied in recent years (see, for instance, [6, 19, 52, 67, 68, 69]).

Sampling in shift-invariant spaces that are not bandlimited is a suitable and realistic model for many applications, e.g., for taking into account real acquisition and reconstruction devices, for modeling signals with smoother spectrum than is the case with bandlimited functions, or for numerical implementation [9, 13, 22, 26, 85, 86, 103, 104, 107, 110, 115, 116]. These requirements can often be met by choosing “appropriate” functions φ_(i). This may mean that the functions φ_(i) have a shape corresponding to a particular “impulse response” of a device, or that they are compactly supported, or that they have a Fourier transform |{circumflex over (φ)}_(i)(ξ)| that decays smoothly to zero as |ξ|→∞.

Uniform Sampling in Shift-Invariant Spaces

Early results on sampling in shift-invariant spaces concentrated on the problem of uniform sampling [7, 9, 10, 11, 37,64, 105, 108, 113, 116] or interlaced uniform sampling [110]. The problem of uniform sampling in shift-invariant spaces shares some similarities with Shannon's sampling theorem in that it requires only the Poisson summation formula and a few facts about Riesz bases [7, 9]. The connection between interpolation in spline spaces, filtering of signals, and Shannon's sampling theory was established in [11, 109]. These results imply that Shannon's sampling theory can be viewed as a limiting case of polynomial spline interpolation when the order of the spline tends to infinity [11, 109]. Furthermore, Shannon's sampling theory is a special case of interpolation in shift-invariant spaces [7, 9, 113, 116] and a limiting case for the interpolation in certain families of shift-invariant spaces V(φ^(n)) that are obtained by a generator φ^(n)=φ* . . . * φ consisting of the n-fold convolution of a single generator φ[9].

In applications, signals do not in general belong to a prescribed shift-invariant space. Thus, when using the bandlimited theory, the common practice in engineering is to force the function ƒ to become bandlimited before sampling. Mathematically, this corresponds to multiplication of the Fourier transform {circumflex over (ƒ)} of ƒ by a characteristic function χ_(Ω). The new function ƒ_(a) with Fourier transform {circumflex over (ƒ)}={circumflex over (ƒ)}χ_(Ω) is then sampled and stored digitally for later processing or reconstruction. The multiplication by χ_(Ω) before sampling is called prefiltering with an ideal filter and is used to reduce the errors in reconstructions called aliasing errors. It has been shown that the three steps of the traditional uniform sampling procedure, namely prefiltering, sampling, and postfiltering for reconstruction, are equivalent to finding the best L²-approximation of a function in L²∩B_(Ω)[9, 105]. This procedure generalizes to sampling in general shift-invariant spaces [7, 9, 10, 85, 105, 108]. In fact, the reconstruction from the samples of a function should be considered as an approximation in the shift-invariant space generated by the impulse response of the sampling device. This allows a reconstruction that optimally fits the available samples and can be done using fast algorithms [106, 107].

Nonuniform Sampling in Shift-Invariant Spaces

The problem of nonuniform sampling in general shift-invariant spaces is more recent [4, 5, 30, 66, 75, 76, 77, 102, 119]. The earliest results [31, 77] concentrate on perturbation of regular sampling in shaft-invariant spaces and are therefore similar in spirit to Kadec's result for bandlimited functions. For the L² case in dimension d=1, and under some restrictions on the shift-invariant spaces, several theorems on nonuniform sampling can be found in [76, 102]. Moreover, a lower bound on the maximal distance between two sampling points needed for reconstructing a function from its samples was given for the case of polynomial splines and other special cases of shift-invariant spaces in [76]. For the general multivariate case in L^(p), the theory was developed in [4], and for the case of polynomial spline shift-invariant spaces, the maximal allowable gap between samples was obtained in [5]. For general shift-invariant spaces, a Beurling density D≧1 is necessary for stable reconstruction [5]. As in the case of bandlimited functions, the theory of frames is central in nonuniform sampling of shift-invariant spaces, and there is an equivalence between a certain type of frame and the problem of sampling in shift-invariant spaces [5, 66, 75].

Among other things, one aim of the present invention is to provide a unified framework for uniform and nonuniform sampling in shift-invariant spaces. This is accomplished by bringing together wavelet theory, frame theory, reproducing kernel Hilbert spaces, approximation theory, amalgam spaces, and sampling. This combination simplifies some parts of the literature on sampling.

The description below contains several new results. In particular, all the well-known results are developed in weighted L^(p)-spaces. Extensions of frame theory and reproducing kernel Hilbert spaces to Banach spaces are discussed, and the connections between reproducing kernels in weighted L^(p)-spaces, Banach frames, and sampling are described.

The rest of this Example is organized as follows. Next section, section 2, introduces the relevant spaces for sampling theory and presents some of their properties. Weighted L^(p)-spaces and sequence spaces are defined. Wiener amalgam spaces are discussed and we also derive some convolution relations in the style of Young's inequalities. The weighted L^(p)-shift-invariant spaces are then introduced in, and some of their main properties are established. The sampling problem in weighted shift-invariant spaces is subsequently disclosed in section 3. Next, in section 4, some aspects of reproducing kernel Hilbert spaces and frame theory are reviewed. The discussion includes an extension of frame theory and reproducing kernel Hilbert spaces to Banach spaces. The connections between reproducing kernels in weighted L^(p)-spaces, Banach frames, and sampling are also discussed. Frame algorithms for the reconstruction of a function from its samples are discussed in section 5 and so are iterative reconstructions in section 6. In applications, a function ƒ does not belong to a particular prescribed space V, in general. Moreover, even if the assumption that a function ƒ belongs to a particular space V is valid, the samples off are not exact due to digital inaccuracy, or the samples are corrupted by noise when they are obtained by a real measuring device. For this reason, the results of the various reconstruction algorithms when the samples are corrupted by noise are presented in section 7 as well, which is an important issue in practical applications. Theorems and lemmas given in this disclosure can be and have been proved by the inventors. Interested reader can find detailed proof and related discussions in reference [f], which is hereby incorporated herein by reference in its entirety.

2. Relevant Spaces

Function Spaces

This section, among other things, provides the basic framework for treating nonuniform sampling in weighted shift-invariant spaces. The shift-invariant spaces under consideration are of the form

$\begin{matrix} {{V(\phi)} = \left\{ {\sum\limits_{k \in Z^{d}}^{\;}{c_{k}{\phi\left( {\cdot {- k}} \right)}}} \right\}} & (2.1) \end{matrix}$ where c=(c_(k))_(kεZ) ^(d) is taken from some sequence space and φ is the so-called generator of V(φ). Before it is possible to give a precise definition of shift-invariant spaces, one needs to study the convergence properties of the series

$\left\{ {\sum\limits_{k \in Z^{d}}^{\;}{c_{k}{\phi\left( {\cdot {- k}} \right)}}} \right\}.$ In the context of the sampling problem the function s in V(φ) must also be continuous. In addition, one may want to control the growth or decay at infinity of the functions in V(φ). Thus the generator φ and the associated sequence space cannot be chosen arbitrarily. To settle these questions, we first discuss weighted L^(p)-spaces with specific classes of weight functions, and we then develop the main properties of amalgam spaces. Only then we give a rigorous definition of a shift-invariant space and derive its main properties in next section. Shift-invariant spaces figure prominently in other areas of applied mathematics, notably in wavelet theory and approximately theory [33, 34]. Our presentation will be adapted to the requirements of sampling theory.

Weighted L^(p) _(v)-Spaces

To model decay or growth of functions, we use weighted L^(p)-spaces [41]. A function ƒ belongs to L^(p) _(v) (

^(d)) with weight function v if vƒ belongs to L^(p) (

^(d)). Equipped with the norm ∥f∥_(L) ^(p) _(v)=∥vƒ∥_(L) ^(p), the space L^(p) _(v) is a Banach space. If the weight function v grow rapidly as |x|→∞, then the functions in L^(p) _(v) decay roughly at a corresponding rate. Conversely, if the weight function v decays rapidly, then the functions in L^(p) _(v) may grow as |x|→∞.

In general, a weight function is just a nonnegative function v. We will use two special types of weight functions as examples. The weight functions denoted by X are always assumed to be continuous, symmetric, i.e., ω(x)=ω(−x), positive, and submultiplicative: 0<ω(x+y)≦ω(x)ω(y) ∀x, yε

^(d)  (2.2) This submultiplicativity condition implies that ω(x)≧ω(0)≧1 for all xε

^(d). For a technical reason, we impose the growth condition

${\sum\limits_{n = 1}^{\infty}\frac{\log\mspace{11mu}\omega\mspace{11mu}({nk})}{n^{2}}} < {\infty\mspace{11mu}{\forall{k \in {Z^{d}.}}}}$ Although most of the results do not require this extra condition on ω, we use it in Lemma 2.11. This condition, however, does not limit in any way the scope of the invention. For simplicity we refer to ω as a submultiplicative weight. A prototypical example is the Sobolev weight ω(x)=(1+|x|)^(α), with α>0. When ω=1, we obtain the usual L^(p)-spaces.

In addition, a weight function v is called moderate with respect to the submultiplicative weight ω or simply ω-moderate, if it is continuous, symmetric, and positive and satisfies C ω(−x)v(y)≧v(x+y) for all x, yε

^(d). For instance, the weights v(x)=(1+|x|)^(β) are moderate with respect to ω(x)=(1+|x|)^(α) if and only if |β|≦α. If v is ω-moderate, then C ω(−x)v(x+y)≧v(y)=v(x+y−x), and it follows that:

$\frac{1}{v\left( {x + y} \right)} \leq {C\;{\omega(x)}{\frac{1}{v(y)}.}}$ Thus, the weight 1/v is also ω-moderate.

If v is ω-moderate, then a simple computation shows that ∥ƒ(·−y)∥_(L) _(v) _(p) ≦Cω(y)∥ƒ∥_(L) _(p) _(v) and in particular, ∥ƒ(·−y)∥L^(p) _(ω≦ω(y)∥ƒ∥L) ^(p) _(ω). Conversely, if L^(p) _(v) is translation-invariant, then

${\omega(x)} = {\sup\limits_{{f}_{L_{v}^{p}} \leq 1}{{f\left( {\cdot {- x}} \right)}}_{L_{v}^{p}}}$ is submultiplicative and v is ω-moderate. To see this, we note that

${\omega(x)} = {\sup\limits_{{f}_{L_{v}^{p}} \leq 1}{{f\left( {\cdot {- x}} \right)}}_{L_{v}^{p}}}$ is the operator norm of the translation operator ƒ→ƒ (·−x). Since operator norms are submultiplicative, it follows that ω(x))ω(y)≧ω(x+y). Moreover,

∫_(R^(d))f(t − x)^(p)v(t)^(p)𝕕t = ∫_(R^(d))f(t)^(p)v(t + x)^(p)𝕕t ≤ ω(x)^(p)∫_(R^(d))f(t)^(p)v(t)^(p)𝕕t Thus, ω(x) v(y)≧v(x+y), and therefore the weighted L^(p)-spaces with a moderate weight are exactly the translation-invariant spaces.

We also consider the weighted sequence spaces l^(p) _(v)(Z^(d)) with weight v: a sequence {(c_(k)):kεZ^(d)} belongs to l^(p) _(v) if ((c v)_(k))=(c_(k)v_(k)) belongs to l^(p) with norm ∥c∥_(lP) _(v) =∥vc∥_(l) _(p) , where (v_(k)) is the restriction of v to Z^(d).

Wiener Amalgam Spaces

For the sampling problem we also need to control the local behavior of functions so that the sampling operation ƒ→(ƒ(x_(j)))_(jεJ) is at least well defined. This is done conveniently with the help of the Wiener amalgam spaces W(L^(p) _(v)). These consist of functions that are “locally in L^(∞) and globally in L^(p) _(v).” To be precise, a measurable function ƒ belongs to W(L^(p) _(v)), 1≦p<∞, if it satisfies

$\begin{matrix} {{f}_{W{(L_{v}^{p})}}^{p} = {{\sum\limits_{k \in Z^{d}}^{\;}{{ess}\mspace{11mu}\sup\left\{ {{{{f\left( {x + k} \right)}}^{p}{v(k)}^{p}};{x \in \left\lbrack {0,1} \right\rbrack^{d}}} \right\}}} < \infty}} & (2.3) \end{matrix}$ If p=∞, a measurable function ƒ belongs to W(L^(∞) _(v)) if it satisfies

$\begin{matrix} {{f}_{W{(L_{v}^{\infty})}} = {{\sup\limits_{k \in Z^{d}}\mspace{11mu}\left\{ {{ess}\mspace{11mu}\sup\left\{ {{{{f\left( {x + k} \right)}}{v(k)}};{x \in \left\lbrack {0,1} \right\rbrack^{d}}} \right\}} \right\}} < {\infty.}}} & (2.4) \end{matrix}$ Note that W(L^(∞) _(v)) coincides with L^(∞) _(v).

Endowed with this norm, W(L^(p) _(v)) becomes a Banach space [43, 45]. Moreover, it is translation invariant; i.e., if ƒεW(L^(p) _(v)), then ƒ(·−y)εW(L^(p) _(v)) and ∥ƒ(·−y)∥_(W(L) _(p) _(v) ⁾ ≦Cω(y)∥ƒ∥_(W(L) _(p) _(v) ⁾.

The subspace of continuous functions W₀(L^(p) _(v))=W(C, L^(p) _(v))⊂W(L^(p) _(v)) is a closed subspace of W(L^(p) _(v)) and thus also a Banach space [43, 45]. We have the following inclusions between the various spaces.

THEOREM 2.1. Let v be ω-moderate and 1≦p≦q≦∞. Then the following inclusions hold:

-   -   (i) W₀(L_(v) ^(p))⊂W₀(L_(v) ^(q)) and W(L_(v) ^(p))⊂W(L_(v)         ^(q))⊂L_(v) ^(p)     -   (ii) W₀(L_(v) ^(p))⊂W₀(L_(v) ^(p)), W(L_(ω) ^(p))⊂W(L_(v) ^(p)),         and L_(ω) ^(p)⊂L_(v) ^(p)

The following convolution relations in the style of Young's theorem [118] are useful.

THEOREM 2.2. Let v be ω-moderate.

-   -   (i) If ƒεL_(v) ^(p) and gεL¹ _(ω), then ƒ*gεL_(v) ^(p) and         ∥ƒƒ*g∥_(L) _(v) _(p) ≦C∥ƒ∥_(L) _(v) _(p) ∥g∥_(L) _(ω) ₁     -   (ii) If ƒεL_(v) ^(p) and gεW(L_(ω) ¹), then ƒ*gεW(L_(v) ^(p))         and ∥ƒ*g∥_(W(L) _(v) _(p) ^()≦C∥ƒ∥) _(L) _(v) _(p) ∥g∥_(W(L)         _(ω) ₁ ⁾     -   (iii) If cεl_(v) ^(p) and dεl_(ω) ¹, then c*dεl_(c) ^(p) and         ∥c*d∥_(l) _(v) _(p) ≦C∥c∥_(l) _(v) _(p) ∥d∥_(l) _(ω) ₁

Remark 2.1. Amalgam spaces and their generalizations have been investigated by Feichtinger, and the results of Theorem 2.1 can be found in [42, 43, 45, 44]. The results and methods developed by Feichtinger can also be used to deduce Theorem 2.2. However, for the sake of completeness, in section 2.4 we present direct proofs of Theorems 2.1 and 2.2 that do not rely on the deep results of amalgam spaces

Shift-Invariant Spaces

Among other things, this section discusses shift-invariant spaces and their basic properties. Although some of the following observations are known in wavelet and approximately theory, they have received little attention in connection with sampling.

Given a so-called generator φ, we consider shift-invariant spaces of the form

$\begin{matrix} {{V_{v}^{p}(\phi)} = \left\{ {{\sum\limits_{k \in Z^{d}}^{\;}{c_{k}{\phi\left( {\cdot {- k}} \right)}}}:{c \in l_{v}^{p}}} \right\}} & (2.5) \end{matrix}$ If v=1, we simply write V^(p)(φ). The weight function v controls the decay or growth rate of the functions in V^(p) _(v)(φ). To some extent, the parameter p also controls the growth of the functions in V^(p) _(v)(φ) but more importantly, p controls the norm we wish to use for measuring the size of our functions. For some applications in image processing, the choice p=1 is appropriate [36]; p=2 corresponds to the energy norm, and p=∞ is used as a measure in some quality control applications. Moreover, the smoothness of a function and its appropriate value of p, 1≦p<∞, for a given class of signals or images can be estimated using wavelet decomposition techniques [36]. The determination of p and the signal smoothness are used for optimal compression and coding of signals and images.

For the spaces V^(p) _(v)(φ) to be well defined, some additional conditions on the generator φ must be imposed. For v=1 and p=2, the standard condition in wavelet theory is often stated in the Fourier domain as

$\begin{matrix} {{{0 < m \leq {{\hat{a}}_{\phi}(\xi)}} = {{\sum\limits_{j \in Z^{d}}^{\;}{{\hat{\phi}\left( {\xi + j} \right)}}^{2}} \leq M < {\infty\mspace{14mu}{for}\mspace{14mu}{almost}\mspace{14mu}{every}\mspace{14mu}\xi}}},{for}} & (2.6) \end{matrix}$ some constants m>0 and M>0 [80, 81]. This condition implies that V²(φ) is a closed subspace of L² and that {φ(·−k):kεZ^(d)} is a Riesz basis of V²(φ), i.e., the image of an orthonormal basis under an invertible linear transformation [33].

The theory of Riesz bases asserts the existence of a dual basis. Specifically, for any Riesz basis for V²(φ) of the form {φ(·−k):kεZ^(d)}, there exists a unique function {tilde over (φ)}εV²(φ) such that {{tilde over (φ)}(·−k):kεZ^(d)} is also a Riesz basis for V²(φ) and such that {tilde over (φ)} satisfies the biorthogonality relation <{tilde over (φ)}(·), φ(·−k)>=δ(k) Where δ(0)=1 and δ(k)=0 for k≠0. Since the dual generator {tilde over (φ)} belongs to V²(φ), it can be expressed in the form

$\begin{matrix} {{\overset{\sim}{\phi}( \cdot )} = {\sum\limits_{k \in Z^{d}}^{\;}\;{b_{k}{{\phi\left( {\cdot {- k}} \right)}.}}}} & (2.7) \end{matrix}$ The coefficients (b_(k)) are determined explicitly by the Fourier series

${{\sum\limits_{k \in Z^{d}}{b_{k}{\mathbb{e}}^{2\pi\;{\mathbb{i}}\; k\;\xi}}} = \left( {\sum\limits_{k \in Z^{d}}{{\hat{\phi}\left( {\xi + k} \right)}}^{2}} \right)^{- 1}};$ i.e., (b_(k)) is the inverse Fourier transform of

$\left( {\sum\limits_{k \in Z^{d}}{{\hat{\phi}\left( {\xi + k} \right)}}^{2}} \right)^{- 1}$ (see, for example, [8, 9]. Since a_(φ)(ξ)⁻¹≦1/m by (2.6), the sequence (b_(k)) exists and belongs to l²(Z^(d)).

In order to handle general shift-invariant spaces V^(p) _(v)(φ) instead of V²(φ), we need more information about the dual generator. The following result is one of the central results in this disclosure and is useful for the treatment of general shift-invariant spaces.

THEOREM 2.3. Assume that φεW(L¹ _(ω)) and that {φ(·−k):kεZ^(d)} is a Riesz basis for V²(φ). Then the dual generator {tilde over (φ)} is in W(L¹ _(ω)).

As a corollary, we obtain the following theorem.

THEOREM 2.4. Assume that φεW(L¹ _(ω)) and that v is ω-moderate.

-   -   (i) The space V^(p) _(v)(φ) is a subspace (not necessarily         closed) of L^(p) _(v) and W(L^(p) _(v)) for any p with 1≦p≦∞.     -   (ii) If {φ(·−k):kεZ^(d)} is a Riesz basis of V²(φ), then there         exist constants m_(p)>0, M_(p)>0 such that

$\begin{matrix} {{m_{p}{c}_{l_{v}^{p}}} \leq {{\sum\limits_{k \in Z^{d}}{c_{k}{\phi\left( {\cdot {- k}} \right)}}}}_{L_{v}^{p}} \leq {M_{p}{c}_{l_{v}^{p}}\mspace{20mu}{\forall{c \in {l_{v}^{p}\left( Z^{d} \right)}}}}} & (2.8) \end{matrix}$

-   -   is satisfied for all 1≦p≦∞ and all ω-moderate weights v.         Consequently, {φ(·−k):kεZ^(d)} is an unconditional basis for         V^(p) _(v)(φ) for 1≦p≦∞, and V^(p) _(v)(φ) is a closed subspace         of L^(p) _(v) and W(L^(p) _(v)) for 1≦p≦∞.

The theorem says that the inclusion in Theorem 2.4(i) and the norm equivalence (2.8) hold simultaneously for all p and all ω-moderate weights, provided that they hold for the Hilbert space V²(φ). But in V²(φ), the Riesz basis property (2.8) is much easier to check. In fact, it is equivalent to inequalities (2.6). In equalities (2.8) imply that L^(p) _(v) and V^(p) _(v)(φ) are isomorphic Banach spaces and that the set {φ(·−k):kεZ^(d)} is an unconditional basis of V^(p) _(v)(φ). In approximation theory we say that φ has stable integer translates and is a stable generator [67, 68, 69]. When v=1 the conclusion (2.8) of Theorem 2.4 is well known and can be found in [67, 68, 69].

As a corollary of Theorem 2.4, we obtain the following inclusions among shift-invariant spaces.

COROLLARY 2.5. Assume that φεW(L¹ _(ω)) and that v is ω-moderate. Then V _(ω) ¹(φ)⊂V _(ω) ^(p)(φ)⊂V _(ω) ^(q)(φ) for 1≦p≦q≦∞

-   -   and         V _(ω) ^(q)(φ)⊂V _(ω) ^(p)(φ) for 1≦q≦∞.

3. The Sampling Problem in Weighted Shift-Invariant Spaces V^(p) _(v)(φ)

For a reasonable formulation of the sampling problem in V^(p) _(v)(φ) the point evaluations ƒ→ƒ(x) must be well defined. Furthermore, a small variation in the sampling point should produce only a small variation in the sampling value. As a minimal requirement, we need the functions in V^(p) _(v)(φ) to be continuous, which is guaranteed by the following statement.

THEOREM 3.1. Assume that φεW₀(L¹ _(ω)), that φ satisfies (2.6), and that v is −ω-moderate.

-   -   (i) V_(v) ^(p)(φ)⊂W₀(L_(v) ^(p)) for all p,1≦p≦∞     -   (ii) If ƒεV_(v) ^(p)(φ), then we have the norm equivalences         ∥ƒ∥_(L) _(v) _(p) ≈∥c∥_(l) _(v) _(p) ≈∥ƒ∥_(W(L) _(v) _(p) ⁾     -   (iii) If X={X_(j):jεJ} is such that in ƒ_(j,l)|x_(j)−x_(l)∥>0,         then

$\begin{matrix} {\left( {\sum\limits_{x_{k} \in X}{{{f\left( x_{k} \right)}}^{p}{{v\left( x_{k} \right)}}^{p}}} \right)^{\frac{1}{p}} \leq {C_{p}{f}_{L_{v}^{p}}\mspace{20mu}{\forall{f \in {{V_{v}^{p}(\phi)}.}}}}} & (3.1) \end{matrix}$ In particular, if φ is continuous and has compact support, then the conclusions (i)-(iii) hold.

A set X={x_(j):jεJ} satisfying in ƒ_(j,l)|x_(j)−x_(l)|>0 is called separated.

Inequality (3.1) has two interpretations. It implies that the sampling operator S_(X):ƒ→ƒ|_(x) is a bounded operator from V^(p) _(v)(φ) into the corresponding sequence space

${l_{v}^{p}(X)} = \left\{ {{\left( c_{j} \right)\text{:}\left( {\sum\limits_{j \in J}{{c_{j}}^{p}{v\left( x_{j} \right)}^{p}}} \right)^{\frac{1}{p}}} < \infty} \right\}$ Equivalently, the weighted sampling operator S_(X):ƒv|_(X) is a bounded operator from V^(p) _(v)(φ) into L^(p).

To recover a function ƒεV^(p) _(v)(φ) from its samples, we need a converse of inequality (3.1). Following Landau [74], we say that X is a set of sampling for V^(p) _(v)(φ) if

$\begin{matrix} {{c_{p}{f}_{L_{v}^{p}}} \leq \left( {\sum\limits_{x_{j} \in X}{{{f\left( x_{j} \right)}}^{p}{{v\left( x_{j} \right)}}^{p}}} \right)^{\frac{1}{p}} \leq {C_{p}{f}_{L_{v}^{p}}}} & (3.2) \end{matrix}$ where c_(p) and C_(p) are positive constants independent of ƒ.

The left-hand inequality implies that if ƒ(x_(j))=0 for all x_(j)εX, then ƒ=0. Thus X is a set of uniqueness. Moreover, the sampling operator S_(X) can be inverted on its range and S_(X) ⁻¹ is a bounded operator from Range (S_(X))⊂l^(p) _(v)(X) to V^(p) _(v)(φ). Thus (3.2) says that a small change of a sampled value ƒ(x_(j)) causes only a small change of ƒ. This implies that the sampling is stable or, equivalently, that the reconstruction of ƒ from its samples is continuous. As pointed out in section 1, every set of sampling is a set of uniqueness, but the converse is not true. For practical considerations and numerical implementations, only sets of sampling are of interest, because only these can, lead to robust algorithms.

A solution to the sampling problem may include, among other things, the following two parts:

-   -   (a) Given a generator φ, we need to find conditions on X,         usually in the form of a density, such that the norm equivalence         (3.2) holds. Then, at least in principle, ƒεV^(p) _(v)(φ) is         uniquely and stably determined by ƒ|_(X).     -   (b) We need to design reconstruction procedures that are useful         and efficient in practical applications. The objective is to         find efficient and fast numerical algorithms that recover ƒ from         its samples ƒ|_(X), when (3.2) is satisfied.

Remark 3.1

-   -   (i) The hypothesis that X be separated is for convenience only         and is not essential. For arbitrary sampling sets, we can use         adaptive weights to compensate for the local variations of the         sampling density [48, 49]. Let V_(j)={xε         ^(d):|x−x_(j)|≦|x−x_(k) | for all k≈j} be the Voronoi region at         x_(j), and let γ_(j)=λ(V_(j)) be the size of V_(j). Then X is a         set of sampling for V^(p) _(v)(φ) if

$\begin{matrix} {{c_{p}\;{f}_{L_{v}^{p}}} \leq \left( {\sum\limits_{x_{j} \in X}{{{f\left( x_{j} \right)}}^{p}\gamma_{j}{{v\left( x_{j} \right)}}^{p}}} \right)^{\frac{1}{p}} \leq {C_{p}{f}_{L_{v}^{p}}}} & \; \end{matrix}$

-   -    In numerical applications the adaptive weights γ_(j) are used         as a cheap device for preconditioning and for improving the         ratio C_(p)/c_(p), the condition number of the set of sampling         [49, 101].     -   (ii) The assumption that the samples {ƒ(x_(j)):jεJ} can be         measured exactly is not realistic. A better assumption is that         the sampled data is of the form

$\begin{matrix} {g_{x_{j}} = {\int_{R^{d}}{{f(x)}{\psi_{x_{j}}(x)}\ {\mathbb{d}x}}}} & (3.3) \end{matrix}$

-   -    where {ψ_(x) _(j) :x_(j)εX} is a set of functionals that act on         the function ƒ to produce the data {g_(x) _(j) :x_(j)εX}. The         functionals {ψ_(x) _(j) :x_(j)εX} may reflect the         characteristics of the sampling devices. For this case, the         well-posedness condition (3.2) must be replaced by

$\begin{matrix} {{c_{p}{f}_{L^{p}}} \leq \left( {\sum\limits_{x_{j} \in X}{{g_{x_{j}}(f)}}^{p}} \right)^{\frac{1}{p}} \leq {C_{p}{f}_{L^{p}}}} & (3.4) \end{matrix}$

-   -    where g_(xj) are defined by (3.3) and where c_(p) and C_(p) are         positive constants independent off [1].

4. Reproducing Kernel Hilbert Spaces, Frames, and Nonuniform Sampling

As disclosed above, results of Paley and Wiener and Kadec relate Riesz bases consisting of complex exponentials to sampling sets that are perturbations of Z. More generally, the appropriate concept for arbitrary sets of sampling in shift-invariant spaces is the concept of frames discussed below. Frame theory generalizes and encompasses the theory of Riesz bases and enables us to translate the sampling problem into a problem of functional analysis. The connection between frames and sets of sampling is established by means of reproducing kernel Hilbert spaces (“RKHSs”), discussed below. Frames are introduced in next section, and the relation between RKHSs frames, and sets of sampling is developed subsequently.

RKHSs

Theorem 3.1 (iii) holds for arbitrary separated sampling sets, so in particular Theorem 3.1 (iii) shows that all point evaluations ƒ→ƒ(x) are continuous linear functionals on V^(p) _(v)(φ) for all xε

^(d). Since V^(p) _(v)(φ)⊂L^(p) _(v) and the dual space of L^(p) _(v) is L^(p′) _(1/v), where 1/p+1/p′=1, there exists a function K_(x)εL^(p) _(v) such that

${f(x)} = {\left\langle {f,K_{x}} \right\rangle = {\int_{R^{d}}{{f(t)}\overset{\_}{K_{x}(t)}\ {\mathbb{d}t}}}}$ for all ƒεV^(p) _(v)(φ). In addition, it will be shown that K_(x)εV^(p) _(1/v)(φ)

In the case of a Hilbert space H of continuous functions on

^(d), such as V²(φ), the following terminology is used. A Hilbert space is an RKHS [117] if, for any xε

^(d), the pointwise evaluation ƒ→ƒ(x) is a bounded linear functional on H. The unique functions K_(x)→H satisfying ƒ(x)=(ƒ, K_(x)) are called the reproducing kernels of H.

With this terminology we have the following consequence of Theorem 3.1.

THEOREM 4.1. Let v be ω-moderate. If φεW₀(L¹ _(ω)), then the evaluations ƒ→ƒ(x) are continuous functionals, and there exist functions K_(x)εV¹ _(ω)(φ) such that ƒ(x)=<ƒ, K_(x)>. The kernel functions are given explicitly by

$\begin{matrix} {{K_{x}(y)} = {\sum\limits_{k \in Z^{d}}^{\;}{\overset{\_}{\phi\left( {x - k} \right)}{\overset{\sim}{\phi}\left( {y - k} \right)}}}} & (4.1) \end{matrix}$ In particular, V²(φ) is an RKHS.

The above theorem is a reformulation of Theorem 3.1. We only need to prove the formula for the reproducing kernel. Note that K_(x) in (4.1) is well defined: since {tilde over (φ)}εW₀(L¹ _(ω)), Theorem 2.3 combined with Theorem 3.1 (iii) implies that the sequence {{tilde over (φ)}(x−k):kεZ^(d)} belongs to l¹ _(ω). Thus, by the definition of V¹ _(ω)(φ), we have K_(x)εV¹ _(ω)(φ), and so K_(x)εV^(p) _(v)(φ) for any p with 1≦p≦∞ and any ω-moderate weight v. Furthermore, K_(x) is clearly the reproducing kernel, because if ƒ(x)=Σ_(k)C_(K)φ(x−k), then

$\left\langle {f,K_{x}} \right\rangle = {{\sum\limits_{j,k}^{\;}{c_{j}{\phi\left( {x - k} \right)}\left\langle {{\phi\left( {\cdot {- j}} \right)},{\overset{\sim}{\phi}\left( {\cdot {- k}} \right)}} \right\rangle}} = {{\sum\limits_{k}^{\;}{c_{k}{\phi\left( {x - k} \right)}}} = {f(x)}}}$

Frames

In order to reconstruct a function ƒεV^(p) _(v)(φ) from its samples ƒ(x_(j)), it is sufficient to solve the (infinite) system of equations

$\begin{matrix} {{\sum\limits_{k \in Z^{d}}^{\;}{c_{k}{\phi\left( {x_{j} - k} \right)}}} = {f\left( x_{j} \right)}} & (4.2) \end{matrix}$ for the coefficients (c_(k)). If we introduce the infinite matrix U with entries U _(jk)=φ(x _(j) −k)  (4.3) indexed by X×Z^(d), then the relation between the coefficient sequence c and the samples is given by Uc=ƒ|x.

Theorem 3.1(ii) and (iii) imply that ƒ|_(X)εl^(p) _(v)(X). Thus U maps l^(p) _(v)(Z^(d)) into l^(p) _(v)(X).

Since ƒ(x)=<ƒ,K_(x)>, the sampling inequality (3.2) implies that the set of reproducing kernels {K_(xj), x_(j)εX} spans V^(p′) _(1/V). This observation leads to the following abstract concepts.

A Hilbert frame (or simply a frame) {e_(j):jεJ} of a Hilbert space H is a collection of vectors in H indexed by a countable set J such that

$\begin{matrix} {{A{f}_{H}^{2}} \leq {\sum\limits_{j}^{\;}{\left\langle {f,e_{j}} \right\rangle }^{2}} \leq {B{f}_{H}^{2}}} & (4.4) \end{matrix}$ for two constants A, B>0 independent of ƒεH[40].

More generally, a Banach frame for a Banach space B is a collection of functionals {e_(j):jεJ}⊂B* with the following properties [54].

-   -   (a) There exists an associated sequence space B_(d) on the index         set J, such that

Af_(B) ≤ (⟨f, e_(j)⟩)_(j ∈ J)_(B_(d)) ≤ Bf_(B) for two constants A,B>0 independent of ƒεB.

-   -   (b) There exists a so-called reconstruction operator R from         B_(d) into B such that

R((⟨f, e_(j)⟩)_(j ∈ J)) = f

Relations between RKHSs, Frames, and Nonuniform Sampling

The following theorem translates the different terminologies that arise in the context of sampling theory [2, 40, 74].

THEOREM 4.2 The following are equivalent:

-   -   (i) X={x_(j):jεJ} is a set of sampling for V^(p) _(v)(φ).     -   (ii) For the matrix U in (4.3), there exist a, b>0 such that

ac_(l_(v)^(p)) ≤ Uc_(l_(v)^(p)(X)) ≤ bc_(l_(v)^(p))∀c ∈ l_(v)^(p)

-   -   (iii) There exist positive constants a>0 and b>0 such that

${a{f}_{L_{v}^{p}}} \leq \left( {\sum\limits_{x_{j} \in X}^{\;}{{{f\left( x_{j} \right)}}^{p}{{v\left( x_{j} \right)}}^{p}}} \right)^{1/p} \leq {b{f}_{L_{v}^{p}}{\forall{f \in {V_{v}^{p}(\phi)}}}}$

-   -   (iv) For p=2, the set of reproducing kernels {K_(xj):x_(j)εX} is         a (Hilbert) frame for V²(φ).

Remark 4.1

-   -   (i) The relation between RKHSs and uniform sampling of         bandlimited functions was first reported by Yao [170] and used         to derive interpolating series similar to (1.1). For the case of         shift-invariant spaces, this connection was established in (9).         Sampling for functions in RKHSs was studied in [84]. For the         general case of nonuniform sampling in shift-invariant spaces,         the connection was established in [5].     -   (ii) The relation between Hilbert frames and sampling of         bandlimited functions is well known [14, 48]. Sampling in         shift-invariant spaces is more recent, and the relation between         frames and sampling in shift-invariant spaces (with p=2 and v=1)         can be found in [5, 30, 75, 77, 102].     -   (iii) The relation between Hilbert frames and the weighted         average sampling mentioned in Remark 3.1 can be found in [1].         This relation is obtained via kernels that generalize the RKHS.

5. Frame Algorithms for L^(p) _(v)-Spaces

Theorem 4.2 states that a separated set X={x_(j):jεJ} is a set of sampling for V²(φ) if and only if the set of reproducing kernels {{tilde over (K)}_(x) _(j) :x_(j)εX} is a frame for V²(φ). It is well known from frame theory that there exists a dual frame {{tilde over (K)}_(x) _(j) :x_(j)εX} that allows us to reconstruct the function ƒ⊂V²(φ) explicitly as

$\begin{matrix} {{f(x)} = {{\sum\limits_{j \in J}^{\;}{\left\langle {f,K_{x_{j}}} \right\rangle{{\overset{\sim}{K}}_{x_{j}}(x)}}} = {\sum\limits_{j \in J}^{\;}{{f\left( x_{j} \right)}{{\overset{\sim}{K}}_{x_{j}}(x)}}}}} & (5.1) \end{matrix}$ However, a dual frame {{tilde over (K)}_(x) _(j):x_(j)εX} is difficult to find in general, and this method for recovering a function ƒεV²(φ) from its samples {ƒ(x_(j)):x_(j)εX} is often not practical.

Instead, the frame operator

$\begin{matrix} {{{Tf}(x)} = {{\sum\limits_{j \in J}^{\;}{\left\langle {f,K_{x_{j}}} \right\rangle{K_{x_{j}}(x)}}} = {\sum\limits_{j \in J}^{\;}{{f\left( x_{j} \right)}{K_{x_{j}}(x)}}}}} & (5.2) \end{matrix}$ can be inverted via an iterative that we now describe. The operator

$I - {\frac{2}{A + B}T}$ is contractive, i.e., the operator norm on L²(

^(d)) satisfies the estimate

${{I - {\frac{2}{A + B}T}}}_{op} \leq \frac{B - A}{A + B} < 1$ where A, B are frame bounds for {K_(x) _(j) :x_(j)εX}. Thus,

$\frac{2}{A + B}T$ can be inverted by the Neumann series

${\frac{A + B}{2}T^{- 1}} = {\sum\limits_{n = 0}^{\infty}\left( {I - {\frac{2}{A + B}T}} \right)^{n}}$ This analysis gives the iterative frame reconstruction algorithm, which is made up of an initialization step

$f_{1} = {\sum\limits_{j \in J}^{\;}{{f\left( x_{j} \right)}K_{x_{j}}}}$ and iteration

$\begin{matrix} {f_{n} = {{\frac{2}{A + B}f_{1}} + {\left( {I - {\frac{2}{A + B}T}} \right)f_{n - 1}}}} & (5.3) \end{matrix}$ As n→∞, the iterative frame algorithm (5.3) converges to ƒ_(∞)=T⁻¹ƒ₁=T¹Tƒ=ƒ.

Remark 5.1

-   -   (i) The computation of T requires the computation of the         reproducing frame functions {K_(x) _(j) :x_(j)εX}, which is a         difficult task. Moreover, for each sampling set X we need to         compute a new set of reproducing frame functions {K_(x) _(j)         :x_(j)εX}.     -   (ii) Even if the frame functions {K_(x) _(j) :x_(j)εX} are         known, the performance of the frame algorithm depends         sensitively on estimates for the frame bounds.

Since accurate and explicit frame bounds, let alone optimal ones, are hardly ever known for nonuniform sampling problems, the frame algorithm converges very slowly in general. For efficient numerical computations involving frames, the primitive iteration (5.3) should therefore be replaced almost always by acceleration methods, such as Chebyshev or conjugate gradient acceleration. In particular, conjugate gradient methods converge at the optimal rate, even without any knowledge of the frame bounds [49, 56].

-   -   (iii) The convergence of the frame algorithm is guaranteed only         in L², even if the function belongs to other spaces L^(p) _(v).         It is a remarkable fact that in Hilbert space the norm         equivalence (4.4) alone guarantees that the frame operator is         invertible. In Banach spaces the situation is much more         complicated and the existence of a reconstruction procedure must         be postulated in the definition of a Banach frame. In the         special case of sampling in shift-invariant spaces, the frame         operator T is invertible on all V^(p) _(v)(φ) whenever T is         invertible on V²(φ) and φ possesses a suitable polynomial decay         [57].

6. Iterative Reconstruction Algorithms

Since the iterative frame algorithm is often slow to converge and its convergence is not even guaranteed beyond V²(φ), alternative reconstruction procedures have been designed [4, 76]. These procedures are also iterative and based on a Neumann series. New iterative reconstruction algorithms developed according to the present invention are disclosed and discussed below.

In one embodiment, as shown in FIG. 5, at step 503, samples {ƒ(x_(j)):x_(j)εX} are obtained for function ƒ of an object of interest. At step 505, the function ƒ is approximated from its samples {ƒ(x_(j)):x_(j)εX} using an interpolation or a quasi-interpolation Q_(x)ƒ. For examples, Q_(x)ƒ could be a piecewise linear interpolation of the samples ƒ|_(X) or even an approximation by step functions, the so-called sample-and-hold interpolant.

At step 507, the approximation Q_(x)ƒ is then projected in the space V^(p) _(v)(φ) to obtain the first approximation ƒ₁=PQ_(X)ƒεV^(p) _(v)(φ), which then can be fed back, at step 501, to sampling operator S_(x) and produce an ƒ₁(X). The error e=ƒ−ƒ₁ between the functions ƒ and ƒ₁ belongs to the space V^(p) _(v)(φ). Moreover, the values of e on the sampling set X can be calculated, at step 505, from {ƒ(x_(j)):x_(j)εX} and (PQ_(X)ƒ)(x_(j)). Then we repeat the interpolation projection procedure on e and obtain a correction e₁. The updated estimate is now, at step 509, ƒ₂=ƒ₁+e₁, which can then be fed back to step 501 for a new round of calculation. By repeating this procedure, we obtain a sequence ƒ_(n)=ƒ₁+e₁+e₂+e₃+ . . . +e_(n−1) that converges to the function ƒ.

In order to prove convergence results for this type of algorithm, we need the sampling set to be dense enough. The appropriate definition for the sampling density of X is again due to Beurling.

DEFINITION 6.1. A set X={x_(j):jεJ} is ε₀-dense in

^(d) if

$\begin{matrix} {R^{d} = {\bigcup\limits_{j}{{B_{\gamma}\left( x_{j} \right)}\mspace{14mu}{\forall{\gamma > {\gamma_{0}.}}}}}} & (6.1) \end{matrix}$

This definition implies that the distance of any sampling point to its nearest neighbor is at most 2γ₀. Thus, strictly speaking, ε₀ is the inverse of a density; i.e., if ε₀ increases, the number of points per unit cube decreases. In fact, if a set X is ε₀-dense, then its Beurling density defined by (1.2) satisfies D(X)≧γ₀ ⁻¹. This last relation states that Δ₀-density imposes more constraints on a sampling set X than the Beurling density D(X).

To create suitable quasi-interpolants, we proceed as follows: Let {β_(j)}_(jεJ) be a partition of unity such that

-   -   (1)0<β_(j)≦1 for all jεJ;     -   (2) supp β_(j)⊂B_(γ)(x_(j)); and     -   (3) Σ_(jεJ)β_(j)=1.         A partition of unity that satisfies these conditions is         sometimes called a bounded partition of unity. Then the operator         Q_(X) defined by         Q _(X)ƒ=Σ_(jεJ)ƒ(x _(j))β_(j)         is a quasi-interpolant of the sampled values ƒ|_(X).

In this situation we have the following qualitative statement.

THEOREM 6.1. Let φ in W₀(L¹ _(ω)) and let P be a bounded projection from L^(p) _(v) onto V^(p) _(v)(φ). Then there exists a density γ>0 (γ=γ(v, p, P)) such that any ƒεV^(p) _(v)(φ) can be recovered from its samples {ƒ(x_(j)):x_(j)εX} on any γ-dense set X={x_(j):jεJ} by the iterative algorithm

$\begin{matrix} \begin{Bmatrix} {{f_{1} = {{PQ}_{X}f}}\mspace{101mu}} \\ {f_{n + 1} = {{{PQ}_{X}\left( {f - f_{n}} \right)} + f_{n}}} \end{Bmatrix} & (6.2) \end{matrix}$ Then iterates ƒ_(n) converge to ƒ uniformly and in the W(L^(p) _(v))- and L^(p) _(v)-norms. The convergence is geometric, that is, ∥ƒ−ƒ_(n)∥_(L) _(v) _(p) ≦C∥ƒ−ƒ_(n)∥_(W(L) _(v) _(p) ⁾ ≦C′∥f−ƒ₁∥_(W)L) _(v) _(p) ⁾α^(n) For some α=α(γ)<1.

The algorithm based on this iteration and as illustrated in FIG. 5 has been successfully utilized in practice. A reconstruction of a function ƒ with ∥ƒ∥₂=3.5 using the iteration algorithm as set forth in FIG. 5 according to one embodiment of the present invention is shown in FIG. 6. Referring now to FIG. 6( a), curve 601 represents function ƒ belonging to the shift-invariant space generated by the Gaussian function exp(−x²/σ²), where σ is about 0.81, and its sample values 603, {ƒ(x_(j)), x_(j)εX}, marked by + (with density γ about 0.8). As shown in FIG. 6( b), curve 611 represents error ∥ƒ−ƒ_(n)∥_(L) ² against the number of iterations, indicating good convergence of the reconstruction. As shown in FIG. 6( c), curve 621 represents final error ƒ−ƒ_(n) after 10 iterations. And as shown in FIG. 6( d), curve 631 represents reconstructed function ƒ₁₀ (continuous line) and original samples 603 {ƒ(x_(j)), x_(j)εX}, showing great match between the two.

Additionally, a missing data reconstruction of an MRI image performed according to one embodiment of the present invention is shown in FIG. 7. Referring now to FIG. 7( a), original digital MRI image 701 is shown with 128×128 samples. As shown in FIG. 7( b), MRI image 703 is given with 50% randomly missing samples. As shown in FIG. 7( c), reconstruction image 711 with 50% randomly missing samples using the iterative reconstruction algorithm according to one embodiment of the present invention is given and shows great improvement(s) over image 703. The corresponding shift invariant space is generated by φ(x, y)=β³(x)×β³(y), where β³=χ_([0,1])*χ_([0,1])* χ_([0,1])*, and χ_([0,1]) is the B-spline function of degree 3.

Remark 6.1. For v=1, a special case, Theorem 6.1 was proved in [4]. For a special case of the weighted average sampling mentioned in Remark 3.1, a modified iterative algorithm and a theorem similar to Theorem 6.1 can be found in [1].

Universal Projections in Weighted Shift-Invariant Spaces

Theorem 6.1 requires bounded projections from L^(p) _(v) onto V^(p) _(v)(φ). In contrast to the situation in Hilbert space, the existence of bounded projections in Banach spaces is a difficult problem. In the context of nonuniform sampling in shift-invariant spaces, we would like the projections to satisfy additional requirements. In particular, we would like projectors that can be implemented with fast algorithms. Further, it would be useful to find a universal projection, i.e., a projection that works simultaneously for all L^(p) _(v), 1≦p≦∞, and all weights v. In shift-invariant spaces such universal projections do indeed exist.

THEOREM 6.2. Assume φεW₀(L¹ _(ω)). Then the operator

$P:\left. f\rightarrow{\sum\limits_{k \in Z^{d}}^{\;}{\left\langle {f,{\overset{\sim}{\phi}\left( {\cdot {- k}} \right)}} \right\rangle{\phi\left( {\cdot {- k}} \right)}}} \right.$ is a bounded projection from L^(p) _(v) onto V^(p) _(v)(φ) for all p, 1≦p≦∞, and all ω-moderate weights v.

Remark 6.2. The operator P can be implemented using convolutions and sampling. Thus the universal projector P can be implemented with fast “filtering” algorithms [3].

7. Data Reconstruction in Presence of Noise

In practical applications the given data are rarely the exact samples of a function ƒεV^(p) _(v)(φ). In other words, we generally do not have “perfect” data for an object of interest that can be represented by a function ƒ but data with noise. We assume more generally that ƒ belongs to W₀(L^(p) _(v)); then the sampling operator ƒ→

{ƒ(x_(j)):x_(j)εX} still makes sense and yields a sequence in l^(p) _(v)(X). Alternatively, we may assume that ƒεV^(p) _(v)(φ), but that the sampled sequence is a noisy version of {ƒ(x_(j)):x_(j)εX}, e.g., that the sampling sequence has the form {ƒ′_(x) _(j) =ƒ(x_(j))+η_(j)}εl^(p) _(v)(X). If a reconstruction algorithm is applied to noisy data, then the question arises whether the algorithm still converges, and if it does, to which limit it converges.

To see what is involved, we first consider sampling in the Hilbert space V²(φ). Assume that X={X_(j):jεJ} is a set of sampling for V²(φ). Then the set of reproducing kernels {K_(x) _(j) :x_(j)εX} forms a frame for V²(φ), and so ƒεV²(φ) can be reconstructed from the samples ƒ(x_(j))=<ƒ, K_(x) _(j) > with the help of the dual frame {{tilde over (K)}_(x) _(j) :x_(j)εX}⊂V²(φ) in the form of the expansion

$\begin{matrix} {f = {{\sum\limits_{j \in J}^{\;}{\left\langle {f,K_{x_{j}}} \right\rangle{\overset{\sim}{K}}_{x_{j}}}} = {\sum\limits_{j \in J}^{\;}{{f\left( x_{j} \right)}{\overset{\sim}{K}}_{x_{j}}}}}} & (7.1) \end{matrix}$ If ƒ∉V²(φ), but ƒεW₀(L²), say, then ƒ(x_(j))≠<ƒ,K_(x) _(j) > in general. However, the coefficients (ƒ,K_(x) _(j) ) still make sense for ƒεL² and the frame expansion (7.1) still converges. The following result describes the limit of this expansion when ƒ∉V²(φ).

THEOREM 7.1. Assume that X⊂

^(d) is a set of sampling for V²(φ) and let P be the orthogonal projection from L² onto V²(φ). Then

${P\; f} = {\sum\limits_{j \in J}{\left\langle {f,K_{x_{j}}} \right\rangle{\overset{\sim}{K}}_{x_{j}}}}$ for all ƒεL².

The previous theorem suggests a procedure for sampling: the function ƒ is first “prefiltered” with the reproducing kernel K_(x) to obtain the function f_(a) defined by ƒ(x)=<ƒ,K_(x)> for all xε

^(d). Sampling f_(a) on X then gives a sequence of inner products ƒ_(a)(x_(j))=<ƒ,K_(x) _(j) >. The reconstruction (7.1) off, is then the least square approximation off by a function ƒ_(a)εV²(φ). In the case of bandlimited functions, we have φ(x)=sinπx/(πx) and Kx(t)=(sinπt(t−x))/(π(t−x)). Then the inner product f_(a)(x)=<ƒ,K_(x)>=ƒ*φ(x) is just a convolution. The filtering operation corresponds to a restriction of the bandwidth to [−½, ½], because (f*φ)^={circumflex over (ƒ)}·χ_([−1/2,1/2]), and is usually called prefiltering to reduce aliasing.

In practical situations, any sampling sequence may be perturbed by noise. This perturbation can be modeled in several equivalent ways: (a) The function ƒεV²(φ) is sampled on X, and then noise η_(j)εl² is added, resulting in a sequence ƒ′_(j)=ƒ(x_(j))+η_(j). (b) One can start with an arbitrary sequence ƒ′_(j)εl²(X). (c) One can sample a function ƒεW₀(L²) which is not necessarily in V²(φ).

In this situation, according to one embodiment of the present invention, we wish to know what happens if we run the frame algorithm with the input sequence {ƒ′_(j):jεJ}. If {ƒ′_(j)jεJ}εl²(X), we can still initialize the iterative frame algorithm by

$\begin{matrix} {g_{1} = {\sum\limits_{j \in J}{f_{j}^{\prime}K_{x_{j}}}}} & (7.2) \end{matrix}$ This corresponds exactly to the first step in the iterative frame algorithm (5.3). Then we set

$\begin{matrix} {g_{n} = {{\frac{2}{A + B}g_{1}} + {\left( {I - {\frac{2}{A + B}T}} \right)g_{n - 1}}}} & (7.3) \end{matrix}$ Since {K_(x) _(j) } is a frame for V²(φ) by assumption, this iterative algorithm still converges in L², and its limit is

$\begin{matrix} {g_{\infty} = {{\lim\limits_{n\rightarrow\infty}\; g_{n}} = {\sum\limits_{j \in J}{f_{j}^{\prime}{\overset{\sim}{K}}_{x_{j}}}}}} & (7.4) \end{matrix}$

THEOREM 7.2. Let X be a set of sampling for V²(φ). Then for any {ƒ′_(j):jεJ}εl²(X), the modified frame algorithm (7.3) with the initialization (7.2) converges to

$g_{\infty} = {{\sum\limits_{j \in Z^{d}}{f_{j}^{\prime}{\overset{\sim}{K}}_{x_{j}}}} \in {{V^{2}(\phi)}.}}$ We have that

${\sum\limits_{j \in J}{{f_{j}^{\prime} - {g_{\infty}\left( x_{j} \right)}}}^{2}} < {\sum\limits_{j \in J}{{f_{j}^{\prime} - {g\left( x_{j} \right)}}}^{2}}$ For all gεV²(φ) with equality if and only if g=g_(∞). Thus g_(∞) fits the given data optimally in the least squares sense.

Next we investigate the iterative algorithm (6.2) in the case of noisy samples {ƒ′_(j):jεJ}εl^(p) _(v)(X). We use initialization

$\begin{matrix} {f_{1} = {{P\; Q_{X}f^{\prime}} = {P\left( {\sum\limits_{j \in J}{f_{j}^{\prime}\beta_{j}}} \right)}}} & (7.5) \end{matrix}$ and define the recursion as in (6.2) by ƒ_(n)=ƒ₁+(I−PQ _(X))ƒ_(n−1)  (7.6) The convergence of this algorithm is clarified in the following theorem (see FIG. 8).

THEOREM 7.3. Under the same assumptions as in Theorem 6.1, the algorithm (7.6) converges to a function ƒ_(∞)εV^(p) _(v)(φ), which satisfies PQ_(X)ƒ_(∞)=PQ_(X){ƒ′_(j)}.

A reconstruction of a function ƒ with additive noise using the iteration algorithm as set forth in FIG. 5 and further disclosed above according to one embodiment of the present invention is shown in FIG. 8. Referring now to FIG. 8( a), curve 801 represents a function ƒ belonging to the shift-invariant space generated by the Gaussian function exp(−x²/σ²) with σ≈0.81. As shown in FIG. 8( b), curve 811 represents the function ƒ with an additive white noise, where SNR≈0 db). As shown in FIG. 8( c), curve or distribution 821 represents noisy signal sampled on a nonuniform grid with maximal gap 0.51. As shown in FIG. 8( d), curve 831 represents reconstructed function ƒ₁₀ only after 10 iterations (continuous line) in comparison (and agreement) with original signal ƒ (dotted line) from curve 801.

Example 2 Fast Local Reconstruction Methods for Uniform and Nonuniform Data Sampling in Shift Invariant Spaces

Approach Overview

In one aspect, the present invention relates to a method for fast reconstruction of a function ƒ from its samples ƒ(x_(j)), where ƒ belongs to a shift invariant space V(φ) and φ is a generator. If the generator φ has compact support, then the reconstruction is local quite in contrast to methods based on band-limited functions. In one embodiment, it is shown that the matrix of the corresponding linear system of equations is a positive-definite banded matrix. This special structure makes possible the fast local reconstruction algorithm in O(S²J) operations, where J is the number of samples and S is the support length of the generator φ. Further optimization can be achieved by means of data segmentation. Several numerical simulations according to the present invention are provided.

In another aspect, the present invention relates to a method for converting data for an object of interest, which is characterized by a functions, between a digital form and an analog form. In one embodiment, the method includes the steps of locally selecting a plurality of data sample points in the order of N, N being an integer, wherein the data sample points are in a first form of data type, performing a transformation in a shift-invariant space to the locally selected data sample points to obtain a new data set that is in a second form of data type different from the first form of data type, and reconstructing the object of interest ƒ from the new data set. In one embodiment, the first form of data type is one of the digital form and the analog form, and the second form of data type is one of the digital form and the analog form that is different from the first form of data type. In other words, the first form of data type can be in digital form, and the corresponding second form of data type is in analog form, and vice versa.

1. Introduction

As set forth above, shift-invariant spaces serve as a universal model for uniform and nonuniform sampling of functions. Normally, the objective of the so-called sampling problem is either to recover a signal (function) ƒ from its samples {ƒ(x_(j))

Z} or to approximate a data set (x_(j),y_(j)) by a suitable function ƒ satisfying ƒ(x_(j))≠Y_(j). Obviously this problem is ill-posed, and so a successful reconstruction requires some a priori information about the signal. Usually it is assumed that ƒ is contained in the span of integer translates of a given generator φ. In technical terms, the original function ƒ has the form

${f(x)} = {\sum\limits_{k \in Z^{c_{k}}}{\varphi\left( {x - k} \right)}}$ and belongs to the shift-invariant space V(φ).

Until recently the only choice for p was the cardinal sine function

${{\varphi(x)} = \frac{\sin\;\pi\;\alpha\; x}{\pi\;\alpha\; x}},$ since in this case V(φ) coincides with the band-limited functions of band-width 2α. Despite the existence of fast numerical methods [49], this model has some drawbacks because it is non-local, and the behavior of ƒ at a point x also depends on samples far away from x. For this reason, one works with truncated versions of the cardinal sine. This idea leads naturally to work in shift-invariant spaces with a generator p of compact support. The concept of shift-invariant spaces first arose in approximation theory and wavelet theory [33,34,68]. Its potential for the systematic treatment of sampling problems was recognized much later.

Among other things, one goal of this Example is the investigation of specific numerical issues of nonuniform sampling in shift-invariant spaces. Usually the reconstruction algorithms are based on general frame methods or they follow simple iterative schemes. Of course, these can be applied successfully in the context of shift-invariant spaces as well as set forth above. We adopt the philosophy that the optimal numerical algorithms always have to use the special structure of the problem. Hence general purpose algorithms have to be fine-tuned to achieve their optimal performance. Here we use the peculiar structure of shift-invariant spaces with compactly supported generator to solve the sampling problem.

Among other things, we want to reconstruct a function ƒεV(φ) from a finite number of samples ƒ(x_(j)) taken from an interval x_(j)ε[M₀, M₁]. In our derivation of the special structure we use a frame theoretic argument and combine it with the fact that the generator φ has compact support. The resulting algorithm is local in the sense that the complete reconstruction of a function in V(φ) on the interval [M₀, M₁] only requires samples from [M₀,M₁] (quite in contrast to bandlimited functions). By comparing reconstructions in different spline spaces we find that, among other things, the algorithm can be used as an efficient denoising procedure for noisy samples.

The rest of the disclosure for Example 2 is organized as follows: In Section 2 we present the precise technical details of shift-invariant spaces, state the well-known equivalence of sampling problems with the construction of certain frames, and discuss some general reconstruction techniques associated to frames. In Section 3 we exploit the special structure of shift-invariant spaces to derive a local reconstruction algorithm of order O(J) and discuss the numerical issues involved. Section 4 explains the results of the numerical simulations and provides, as an example, a code for the main algorithm.

2. Relevant Concepts

2.1. Shift-Invariant Spaces, Frames, and Sampling

Let φ be a continuous function with compact support of size S so that supp φ

[−S,S].  (1) For convenience we assume that S is a positive integer and thus φ(±S)=0. Then the shift-invariant space V(φ) is defined as V(φ)={ƒεL²(

):ƒ=Σc_(k)φ(x−k) for (c _(k))εl ²(Z)}.  (2)

To guarantee the stability of these representations, we assume that the generator φ is stable, which means that there exists a constant C

0 such that

$\begin{matrix} {{C^{- 1}{c}_{l^{2}}} \leq {{\sum\limits_{k \in Z}{c_{k}{\varphi\left( {\cdot {- k}} \right)}}}}_{2} \leq {C{c}_{l^{2}}}} & (3) \end{matrix}$ for all finite sequences c=(c_(k))_(kεZ), or equivalently, the translates φ(.−k),kεZ, form a Riesz basis for V(φ). As a consequence, V(φ) is a closed subspace of L²(R) and inherits the inner product <.,. > of L²(R).

The sampling problem in V(φ) may be interpreted as the following problem: Given a set of sampling points X={x_(j):jεZ} arranged in increasing order x_(j)<x_(j+1) and a sequence of samples {ƒ(x_(j)):jεZ}, of a function ƒεV(φ), we would like to recover the original function ƒ in a stable and numerically efficient way. Here stability means that there exist (possibly unspecified) constants A, B>0 such that

$\begin{matrix} {{A{f}_{2}} \leq \left( {\sum\limits_{j \in Z}{{f\left( x_{j} \right)}}^{2}} \right)^{1/2} \leq {B{f}_{2}\mspace{34mu}{\forall{f \in {{V(\varphi)}.}}}}} & (4) \end{matrix}$ A sampling set satisfying (4) is called a set of stable sampling.

Thus, for (4) to be valid, we need point evaluations in V(φ) to be well-defined. This is guaranteed by the following lemma given in [5].

Lemma 1

If φ is continuous and satisfies the condition Σ_(kεZ) max_(xε[0,1])|ƒ(x+k)|<∞, in particular, if φ is continuous with compact support, then for all xεR there exists a function K_(x)εV(φ) such that ƒ(x)=<ƒ,K_(x)> for ƒεV(φ). We say that V(φ) is a reproducing kernel Hilbert space.

Explicit formulas for K_(x), are known, see [5], but we do not need them here. Note that with the kernels K_(x), the sampling inequality (4) can be formulated as

${{A{f}_{2}} \leq \left( {\sum\limits_{j \in Z}{\left\langle {f,K_{x_{j}}} \right\rangle }^{2}} \right)^{1/2} \leq {B{f}_{2}}},$ which is equivalent to saying that the set {K_(x) _(j) :jεZ} is a frame for V(φ).

Let U be the infinite matrix with entries U _(jk)=φ(x _(j) −k) j,kεZ.  (5) Then the sampling problem in V(φ) can be formulated in several distinct ways [120]. Lemma 2

If φ satisfies the condition of Lemma 1, then the following are equivalent:

-   -   (i) X={x_(j):jεZ} is a set of sampling for V(φ).     -   (ii) There exist A, B>0 such that         A∥c∥ _(l) ₂ ≦∥Uc∥ _(l) ₂ ≦B∥c∥ _(l) ₂ ∀cεl ²(Z)     -   (iii) The set of reproducing kernels {K_(x) _(j) :jεZ} is a         frame for V(φ).         REMARK. It is difficult to characterize sets of sampling for         V(φ). If φ is a B-spline of order N, i.e., φ=X_([0,1])* . . . *         X_([0,1])(N+1 convolutions), then the main result of [120]         implies that the maximum gap condition         sup_(jεZ)(x_(j+1)−x_(j))=δ<1 is sufficient for the conditions of         Lemma 2 to hold.         2.2. General Purpose Reconstructions

Lemma 2 leads to some general reconstruction techniques that are always applicable.

A. Linear Algebra Solution

One could simply try to solve the (infinite) system of linear equations

$\begin{matrix} {{{\sum\limits_{k \in Z}{c_{k}{\varphi\left( {x_{j} - k} \right)}}} = {{f\left( x_{j} \right)}\mspace{34mu}{\forall{j \in Z}}}},} & (6) \end{matrix}$ for the coefficients (c_(k)), or in the notation of (5) with ƒ|x=(ƒ(x_(j)))_(jεZ) UC=ƒ|x  (7)

B. The Normal Equations

Frequently it is better to consider the associated system of normal equations [124] U*Uc=U*ƒ|x  (8) This approach has the advantage that the matrix T:=U*U is a positive operator on l²(z). Furthermore, if the input y=(y_(j))_(jεZ) does not consist of a sequence of exact samples of ƒεV(φ), then the function

$f = {\sum\limits_{k \in Z}{c_{k}{\varphi\left( {\cdot {- k}} \right)}}}$ corresponding to the solution c=(U*U)⁻¹U*y solves tile least squares problem

$\begin{matrix} {{\sum\limits_{j \in Z}\;{{y_{j} - {f\left( x_{j} \right)}}}^{2}} = {\min\limits_{h \in {v{(\varphi)}}}{\sum\limits_{j \in Z}\;{{{y_{j} - {h\left( x_{j} \right)}}}^{2}.}}}} & (9) \end{matrix}$

C. Frame Approach

Lemma 2(iii) suggests to use versions of the frame algorithm to find a reconstruction of f. By (iii) the frame operator which is defined as

$\begin{matrix} {{S\;{f(x)}} = {{\sum\limits_{j \in Z}{\left\langle {f,K_{x_{j}}} \right\rangle{K_{x_{j}}(x)}}} = {\sum\limits_{j \in Z}{{f\left( x_{j} \right)}{K_{x_{j}}(x)}}}}} & (10) \end{matrix}$ is invertible and its inverse defines the dual frame

_(x) _(j) =S⁻¹K_(x) _(j) εZ. Then the reconstruction is given by

$\begin{matrix} {{f(x)} = {{\sum\limits_{j \in J}{\left\langle {f,K_{x_{j}}} \right\rangle\bullet\; K_{x_{j}}}} = {\sum\limits_{j \in J}{{f\left( x_{j} \right)}\bullet\;{{K_{x_{j}}(x)}.}}}}} & (11) \end{matrix}$

We observe that the linear algebra solution (7) and the frame method are equivalent. By definition the vector of samples is given by Uc=ƒ|x fix. The sampled energy of ƒεV(φ) is

$\begin{matrix} {{\sum\limits_{j \in Z}{{f\left( x_{j} \right)}}^{2}} = {\left\langle {f{{x,f}}x} \right\rangle_{l^{2}} = {\left\langle {{Uc},{Uc}} \right\rangle_{l^{2}} = \left\langle {{U^{*}{Uc}},c} \right\rangle_{l^{2}}}}} & (12) \end{matrix}$ Thus X is a set of sampling if and only if U*U is invertible on l²(Z)

D. Iterative Frame Methods

In nonuniform sampling problems it is usually difficult to calculate the entire dual frame, therefore one often resorts to iterative methods. Since the Richardson-Landweber iteration in the original paper of Duffin-chaeffer [40] is slow and requires good estimates of the frame bounds, we recommend the conjugate gradient acceleration of the frame algorithm for all problems without additional structure [56]. It converges optimally and does not require the estimate of auxiliary parameters.

3. Exploit the Structure of the Problem

So far we have discussed general purpose methods for the reconstruction of the function. These could be applied in any situation involving frames and do riot take into consideration the particular structure of the sampling problem in shift-invariant spaces.

3.1. A Localization Property

We now exploit the special structure of shift-invariant spaces. The following lemma is simple, but crucial. It is a consequence of the assumption that the generator of V(φ) has compact support.

Lemma 3

If supp φ

[−S, S], then T=U*U is a band matrix of (upper and lower) band-width 2S.

Proof. By definition the entries of U*U are

$\left( {U^{*}U} \right)_{k\; l} = {{\sum\limits_{j \in Z}{\overset{\_}{U_{j\; k}}U_{j\; l}}} = {\sum\limits_{j \in Z}{\overset{\_}{\varphi\left( {x_{j} - k} \right)}{{\varphi\left( {x_{j} - l} \right)}.}}}}$ Since φ has compact support, the sum is always locally finite and its convergence does not pose any problem. Since φ(x_(j)−k)=0 if |x_(j)−k|≧S, we find that (U*U)_(kl) can be non-zero only if both |x_(j)−k|<S and |x_(j)−l|<S. In other words, (U*U)_(kl)≠0 implies that |k−l|≦|k−x _(j) |+|x _(j) −l|<2S. This means that only 4S−1 diagonals of U*U contain non-zero entries.

REMARKS. A. Banded matrices and the resulting numerical advantages occur in a number of related problems. For instance, in the interpolation of scattered data by radial functions with compact support, the interpolation matrix is banded, see [121] and the references there. Likewise, the calculation of the optimal smoothing spline on a finite set of arbitrary nodes requires the inversion of a banded matrix [125].

B. Lemma 3 combined with a result of Demko, Moss, and Smith [123] or of Jaffard [126] implies that the inverse matrix possesses exponential decay off the diagonal, i.e., there exist C, A>0 such that

(U^(*)U)_(k l)⁻¹ ≤ Ce^(−Ak− l)   ∀k, l ∈ Z.

To make our treatment more realistic, we take into account that in any real problem only a finite (albeit large) number of samples is given. It turns out that the model of shift-invariant spaces with compactly supported generator possesses excellent localization properties. These are quantified in the next lemma.

Lemma 4

The restriction of ƒεV(φ) to the interval [M₀,M₁] is determined completely by the coefficients c_(k) for kε(M₀−S, M₁+S)∩Z.

Proof. Since φ(x−k)=0 for |x−k|≧S and xε[M₀,M₁], we obtain that M ₀ −S−x−S<k<x+S≦M ₁ +S. Consequently, as Sε

, we have

$\begin{matrix} {{f(x)} = {\sum\limits_{k \in Z}{c_{k}{\varphi\left( {x - k} \right)}}}} \\ {= {\sum\limits_{{{x - k}} < S}{c_{k}{\varphi\left( {x - k} \right)}}}} \\ {= {\sum\limits_{k = {M_{0} - S + 1}}^{M_{1} + S - 1}{c_{k}{{\varphi\left( {x - k} \right)}.}}}} \end{matrix}$

In other words, the exact reconstruction of ƒεV(φ) on [M₀,M₁] requires only the M₁−M₀+2S−1 unknown coefficients c_(k) with kε(M₀−S,M₁+S)∩Z. By counting dimensions, we find that we need at least M₁−M₀+2S−1 samples in [M₀,M₁] for the coefficients to be determined uniquely. Usually the length M₁−M₀ is large compared to S, therefore the additional 2S−1 coefficients amount to a negligible oversampling.

Lemma 4 demonstrates an important theoretical and practical advantage of shift-invariant spaces with compactly supported generators. A function ƒεV(φ) can be reconstructed exactly on an arbitrary interval solely from samples in that interval. In contrast, the restriction of a band-limited function to an interval is not uniquely determined by any finite number of samples in that interval, but can only be approximated by these samples. The localization property expressed in Lemma 4 is one of the main reasons to work with shift-invariant spaces with compactly supported generators as a sampling model!

Finally we remark that uniform sampling at critical density is not local and may even be unstable in this model. If ƒεV(φ) is sampled at ξ+k, kεZ, for some ξε[0,1), then there exists an interpolating function ψ_(ξ) of exponential decay, such that

${f(x)} = {\sum\limits_{k \in Z}{{f\left( {\xi + k} \right)}{{{\psi_{\xi}\left( {x - k} \right)}\lbrack 64\rbrack}.}}}$ In this case the restriction of ƒ to [M₀,M₁] is not determined exclusively by the M₁−M₀ values ƒ(ξ+k) for ξ+kε[M₀, M₁]. Moreover, if φ is continuous, then there always exists a ξε[0,1) such that the reconstruction {ƒ(ξ+k)}→X ƒ is unstable. Jaussen's results in [64] indicate that a small amount of oversampling is an essential hypothesis to guarantee the locality and the stability of its reconstruction. 3.2. A Local Reconstruction Algorithm

In practice we perform the calculations with a truncated version of the matrices U and T. We now combine Lemmas 3 and 4 to provide an efficient numerical reconstruction algorithm according to one embodiment of the present invention.

Algorithm

Input. We assume that finitely many sampling points x₁, . . . , x_(J)ε[M₀,M₁] are given with associated sampling vector y=(y₁, . . . , y_(J))ε

^(J). Assume that J≧M₁−M₀+2S−1 and that the truncated matrix z defined below is invertible.

Step 0. First we define and compute the truncated matrices U=U^(M) ⁰ ^(,M) ¹ and T=T^(M) ⁰ ^(,M) ¹ =U*U, given by their entries

$\begin{matrix} {{U_{j\; k} = {\varphi\left( {x_{j} - k} \right)}}{T_{k\; l} = {\sum\limits_{j = 1}^{J}\;{\overset{\_}{\varphi\left( {x_{j} - k} \right)}{\varphi\left( {x_{j} - 1} \right)}}}}} & (13) \end{matrix}$ for j=1, . . . , J and k,l=M₀−S+1, . . . , M+S−1.

Step 1. Compute b=U*y, i.e.,

$\begin{matrix} {{b_{k} = {{\sum\limits_{j = 1}^{J}\;{\overset{\_}{\varphi\left( {x_{j} - k} \right)}y_{j}\mspace{25mu}{for}\mspace{20mu} k}} = {M_{0} - S + 1}}},\mspace{11mu}\ldots\mspace{11mu},{M_{1} + S - 1}} & (14) \end{matrix}$

Step 2. Solve the system of equations c=T ⁻¹ b.  (15)

Step 3. Compute the restriction of ƒ to [M₀,M₁] by

$\begin{matrix} {{f(x)} = {{\sum\limits_{k = {M_{0} - S + 1}}^{M_{1} + S - 1}{c_{k}{\varphi\left( {x - k} \right)}\mspace{14mu}{for}\mspace{14mu} x}} \in {\left\lbrack {M_{0},M_{1}} \right\rbrack.}}} & (16) \end{matrix}$

Then ƒ is the (unique) least square approximation of the given data vector y in the sense that

$\begin{matrix} {{\sum\limits_{j = 1}^{J}\;{{y_{j} - {f\left( x_{j} \right)}}}^{2}} = {\min\limits_{h \in {V{(\varphi)}}}{\sum\limits_{j = 1}^{J}\;{{{y_{j} - {h\left( x_{j} \right)}}}^{2}.}}}} & (17) \end{matrix}$

If y arises as the sampled vector of an ƒ c V(φ), i.e., yj=ƒ (x_(j)), then this algorithm provides the exact reconstruction of f

Proof. The least square property (17) is clear, since this is exactly the property of the solution of the system of normal equations U*U c=U*y. See [124] for details.

In the case of B-splines a sufficient condition on the sampling density can be extracted from the proofs of Thin. 2.1 and 2.2 of [120]. Assume that x_(j+1)−x_(j)≦δ, and that

$\begin{matrix} {\delta \leq \frac{M_{1} - M_{0}}{M_{1} - {M_{0}2\; S} - 1} < 1.} & (18) \end{matrix}$ Then ƒ is invertible. Condition (18) guarantees that there are at least M₁−M₀+2S−1 samples in [M₀,M₁]. Then the Schoenberg-Whitney theorem [127, p. 167] implies that T is invertible. See [120] for the detailed arguments. 3.3 Data Segmentation

In another embodiment of the present invention, a further optimization of the reconstruction procedure is possible by data segmentation. Instead of solving the large system of equations T _(m) ⁰ ^(,m) ¹ =(U ^(M) ⁰ ^(,M) ¹ )*y, with a band matrix of dimension M₁−M₀+2S−1, we will solve t systems of smaller size. For this purpose we partition the large interval [M0, M1] into t smaller intervals [m_(r),m_(r+1)], r=0, . . . , t−1 with M₀=m₀ and M₁=m_(t).

Now we apply Algorithm 3.2 set forth above to each interval separately. More precisely, given the data (x_(j), y_(j)) where x_(j)ε[m_(r), m_(r+1)], we set tip the matrices U^(m) _(r) ^(,m) ^(r+1) and T^(m) ^(r) ^(,m) ^(r+1) and solve t equations T ^(m) ^(r) ^(,m) ^(r+1) c ^((r))=(U ^(m) ^(r) ^(,m) ^(r+1) )*y ^((r))  (19) where the vector y^((r)) consists of those data y_(j) for which x_(j)ε[m_(r),m_(r+1)] and the coefficient vector c^((r))=(c_(m) _(r) ^(−S+1, . . . ,)C_(m) _(r+1+S−1) )

Among other things, the segmentation technique has a number of practical advantages as follows:

A. The dimension of vectors and matrices can be reduced drastically. Using data segmentation, we solve t small systems of size (M−M₀)/t+2S−1 instead of the large system of size M₁−M₀+2S−1.

B. Parallel processing can be applied because non-adjacent intervals can be handled simultaneously.

C. The function can be reconstructed on specified subintervals at smaller cost. See discussions associated with FIG. 6, infra.

On the other hand, data segmentation may also come with some caveats:

A. The coefficients c_(k) with indices kε[m_(r)−S+1, m_(r+1)+S−1] are computed at least twice because of overlap. Heuristically it has proved best to take averages of the multiply computed coefficients.

B. For a successful execution of the segmentation method it is necessary that each of the small matrices T^(m) ^(r) ^(,m) ^(r+1) is invertible. Again by dimension counts we find that the number of data in the interval [m_(r)m_(r+1)] should exceed the number of variables, #(X∩[m _(r) m _(r+1)])≧m _(r+1) −m _(r)+2S−1 Obviously this condition imposes an upper hound for the possible number of segmentations. 3.4. Implementation Issues

A. In Algorithm 3.2 as set forth above, the most expensive step is the calculation of the matrix U because it requires the point evaluations of φ. However, if the sampling points x_(j) are given, then U and T can be computed in advance and stored. Thus Step 0 can be taken care of before solving the reconstruction problem.

We handle the pointwise evaluation of φ by “quantizing” the generator. This means that for δ>0 sufficiently small we create of vector ψ consisting of entries

${{{\varphi\left( \frac{1}{N} \right)}\mspace{14mu}{for}\mspace{14mu} l} = {- {NS}}},\;\ldots\mspace{11mu},{NS}$ such that

$\begin{matrix} {{{{\varphi(x)} - {\varphi\left( \frac{l}{N} \right)}}} < \delta} & \; & {{{for}\mspace{14mu}{{x - \frac{1}{N}}}} < \frac{1}{2N}} \end{matrix}$ Thus to build the matrix U_(jk)=φ(x_(j)−k) amount to selecting the appropriate entries of ψ. This approximation of U works remarkably well and fast in the numerical simulations.

B. For the solution of the banded system (15) a number of fast algorithms are available. Golub-van Loan [124] offers several efficient algorithms for this task; other options for the inversion of a banded matrix are mentioned in [125]. Since T is assumed to be positive definite, the band Cholesky algorithm seems to be a good choice that minimizes the operation count for Step 2. In one embodiment, MATLAB© is utilized to practice the present invention and it provides the commands SPARSE and CHOL to deal with this task.

C. Usually ƒ is reconstructed on a grid

$G = {\left\{ {{{\frac{1}{N}:l} = {M_{0}N}},\;\ldots\mspace{11mu},{M_{1}N}} \right\}.}$ Then (16) amounts to a discrete convolution, and thus Step 3 can be performed quickly. Again, since φ has compact support, we can use the banded structure of the associated matrix to perform this step. 3.5. Operation Count

We estimate the number of multiplications for Algorithm 3.2. Recall that J is the number of samples, and D=M₁−M₀+2S−1 is the dimension of the problem.

(a) According to (14) each of the D entries of the vector b requires #{j:|x_(j)−k|<S} multiplications. Consequently Step 1 requires

$\begin{matrix} {{\sum\limits_{k = {M_{0} - S + 1}}^{M_{1} + S - 1}{\#\left\{ {j:{{{x_{j} - k}} < S}} \right\}}} = {\sum\limits_{k = {M_{0} - S + 1}}^{M_{1} + S - 1}{\sum\limits_{j = 1}^{J}{{X\left( {{k - S},{k + S}} \right)}\left( X_{j} \right)}}}} \\ {= {\sum\limits_{j = 1}^{J}{\sum\limits_{k = {M_{0} - S + 1}}^{M_{1} + S - 1}{{X\left( {{k - S},{k + S}} \right)}\left( X_{j} \right)}}}} \\ {= {{\sum\limits_{j = 1}^{J}{2\; S}} = {2S\; J}}} \end{matrix}$ operations, because a point x is in at most 2S translates of the open interval (−S S).

(b) Likewise to calculate an entry of T requires #({j:|x_(j)−k|<S}∩{j:|x_(j)−l|<S}) multiplications, see (13). As in (a) we estimate the number of operations to set up the matrix T by

$\begin{matrix} {{\sum\limits_{k = {M_{0} - S + 1}}^{M_{1} + S - 1}{\sum\limits_{l = {M_{0} - S + 1}}^{M_{1} + S - 1}{\#\left( {\left\{ {j:{{{x_{j} - k}} < S}} \right\}\bigcap\left\{ {j:{{{x_{j} - l}} < S}} \right\}} \right)}}} =} \\ {{\sum\limits_{k = {M_{0} - S + 1}}^{M_{1} + S - 1}{\sum\limits_{l = {M_{0} - S + 1}}^{M_{1} + S - 1}{\sum\limits_{j = 1}^{J}{{X\left( {{k - S},{k + S}} \right)}\left( x_{j} \right){X\left( {{l - S},{l + S}} \right)}\left( x_{j} \right)}}}} =} \\ {\sum\limits_{j = 1}^{J}{\left( {\sum\limits_{k = {M_{0} - S + 1}}^{M_{1} + S - 1}{{X\left( {{k - S},{k + S}} \right)}\left( x_{j} \right)}} \right)\left( {\sum\limits_{l = {M_{0} - S + 1}}^{M + S - 1}{X\left( {{l - S},{l + S}} \right)\left( x_{j} \right)}} \right)}} \end{matrix}$

-   -   <J·(2S)².

(c) For the solution of the banded system T c=b by means of the band Cholesky algorithm we need at most D((2S) ²+16S+1)=(M ₁ −M ₀+2S−1)((2S) ²+16S+1)≦J(4S ²+16S+1) operations (and no square roots), see [124, Ch. 4.3.6].

(d) To compute the reconstruction ƒ on a grid

$\left\{ {{{\frac{l}{N}:l} = {M_{0}N}},\;\ldots\mspace{11mu},{M_{1}N}} \right\}$ we need to calculate (M₁−M₀) N point evaluations of ƒ via (16). Since, each point evaluation requires at most 2S multiplications. Thus for the reconstruction on the grid we need at most (M ₁ −M ₀)N·2S≦J·2SN multiplications.

Combining these estimates, we find that Algorithm 3.2 requires O(J(S²+SN))  (20) operations. In other words, the cost of the algorithm according to this embodiment of the present invention is linear in the number of data and quadratic in the size of the generator.

4. Numerical Simulations

In one embodiment, several simulations performed according to the methods and algorithm(s) of the present invention. In our simulation we have used MATLAB. We used the shift-invariant spline spaces with the B-spline of order 3

$\varphi = \underset{\underset{4\mspace{14mu}{times}}{︸}}{{X\left\lbrack {{{- 1}/2},{1/2}} \right\rbrack}^{*}\mspace{11mu}\ldots\mspace{11mu}{{\,^{*}X}\left\lbrack {{{- 1}/2},{1/2}} \right\rbrack}}$ as the generator of V(φ). Thus supp φ

[−2,2] and S=2. Referring now to FIG. 10, the shift-invariant spline spaces with the B-spline of order 3 with φ

[−2,2] and S=2 that can be utilized to practice the present invention is shown. Curve 1101 in FIG. 11 is shown as a plot of the operation count as a function of the number of sampling points. For this simulation, we have reconstructed examples of size 114, 226, 444, 667, 887, 1085, identified by the circles 1103 in FIG. 11, respectively, and used the MATLAB function FLOPS to count the number of operations.

Referring now to FIG. 12, a reconstruction of a function ƒ with additive noise according to one embodiment of the present invention with a signal on the interval [0,128] is shown, where M₀=0, and M₁=128. Since S=2, one needs at least M₁−M₀+2S−1=131 samples. The actual sampling set of FIG. 12 has 200 sample points as calculated and satisfies the maximum gap condition max_(j)(x_(j+1)−x_(j))≈0.67<1. More specifically, curve 1201 as shown in FIG. 12( a) represents original signal.

To make the example more realistic, we have added white noise to the sampled values of a given function ƒεV(φ). Instead of missing the correct values ƒ(x_(j)) in the reconstruction algorithm, we use the noisy values ferr(x_(j))=ƒ(x_(j))+e_(j) so that ferr|x=ƒ|+e. The relative error between the original signal and the noisy signal is measured by

${err}_{samp} = {\frac{{{{ferr}{{x - f}}x}}_{2}}{{{f❘x}}_{2}} = {\left( \frac{\sum\limits_{j = 1}^{J}\;{e_{j}}^{2}}{\sum\limits_{j = 1}^{J}\;{{f\left( x_{j} \right)}}^{2}} \right)^{1/2}.}}$ In our example err_(samp)=63.8%. Curve 1211 as shown in FIG. 12( b) represents original signal with noise.

Moreover, as shown in FIG. 12( c), curve 1221 represents noisy signal sampled on a nonuniform grid. Additionally, as shown in FIG. 12( d), curve 1231 represents reconstructed original signal after 10 iterations (continuous line) in comparison with original signal dotted line from curve 1201. The relative error err_(rec) of the reconstruction measured at the sampling points with respect to the correct samples is now

${err}_{rec} = {\frac{{{f_{rec}{{x - f}}x}}_{2}}{{{f❘x}}_{2}} = {18.5\;\%}}$ The noise reduction is thus err _(samp)=63.8%→err _(rec)=18.5%

Referring now to FIGS. 13A and 13B, the dependence of the reconstruction on the generator φ is investigated and shown, where the generator φ is a B-spline of order N, i.e. φN=X_([−1/2,1/2]* . . . *X[−1/2,1/2)] (N+1-fold convolution). The data set (x_(j),y_(j))_(j<1, . . . ,J) is generated by sampling a function ƒεV(φ₅) and then noise is added. Curve 1301 and 1303 in FIG. 13A(a) represent the original signal and the noisy sampled data, respectively. Then the optimal approximation of these data in the spline space V(φ_(N)), N=0, . . . , 6, starting with an approximation by a step function ƒ_(rec)εV(φ₀) via an approximation by a piecewise linear function ƒ_(rec)εV(φ₁) and ending with a smooth approximation ƒ_(rec)εV(φ₆), are shown by curves 1311, 1321, 1331, 1341, 1351, 1361 and 1371 in FIG. 13A(b)-(d) and FIG. 13B(e)-(h), respectively.

In each case we have also plotted the original function ƒ (dotted line curve 1301) for comparison. In addition, the relative error err_(samp) is indicated. The dependency of this error of N is a typical L-curve as it occurs in regularization procedures. In all our examples the best approximation is obtained in the correct space in which ƒ was originally generated. This observation is consistent with the extended literature on smoothing splines, e.g., [122, 125, 128]. One of the main differences between those methods and the algorithm of Section 3.2 of the present invention is in the underlying function space. The reconstruction algorithm 3.2 finds the best local reconstruction in the shift-invariant spline spaceV(φ), whereas the smoothing spline of [122] is based on the nodes x_(j) and does not belong to a fixed function space.

Referring now to FIG. 14, the associated banded matrix T of the linear system according to one embodiment of the present invention is shown as curve (substantially a linear line/lines) 1401. In FIG. 14, white squares correspond to zero entries, dark squares signify large entries of T, the shading being proportional to the size. The banded structure is clearly visible.

Referring now to FIG. 15, the power of the method of data segmentation according to one embodiment of the present invention is shown. Instead of reconstructing the entire signal f, we have reconstructed only the restriction to two disjoint intervals, represented by curves 1501, 1503 respectively, in comparison with original data curve 1301. In the absence of noise the reconstruction is exact. Since supp(φ)⊂[−S, S], the calculation for the two intervals can be done locally and simultaneously. This property can be used for parallel processing.

5. An Exemplary Code

By way of example, the following is a code for fast local data reconstruction in shift invariant spaces according to one embodiment of the present invention as set forth above:

function ƒ_rec=reconstruction(xp, xs, x_rec, t);

function f_rec = reconstruction(xp, xs, x_rec, t); % xp ... sampling positions % xs ... sampling values % x_rec ... positions, where the function should be reconstructed % gen ... generator with support supp(gen)=[−S,S] % t ... number of segmentation step = round((max(x_rec)−min(x_rec))/t); for k = min(x_rec):step:max(x_.rec) xp_rel = {xp: k−S < xp < k + step + S} % relevant sampling positions % or the interval [k, k + step] xp_mm = min(xp.rel); xp_max = max(xprel); J = length(xp_rel); % number of sampling points % calculation of the left side b: for j=1:J mi=ceil (xp(j))−S; ma=floor (xp(j) )+S; for l = mi : ma b(l−mi+1) = b(l−mi+1) + xs(j)*gen(xp(j)−l); end end % calculation of the matrix T: T=zeros(xp_max−xp_min+1+2*S,xp_max−xp_min+1+2*S); for j=1:J mi=ceil (xp(j))−S; ma=floor (xp(j) )+S; for k =mi : ma for l=ma : ma T(k−mi+1,l−mi+1) = T(k−mi+1,l−mi+1) + gen(xp(j)− l)*gen(xp(j)−l); end end end % calculation of the coefficients c_part = chol(T,b); % solving the system T*c_part=b with a % banded Cholesky algorithm c(xp_min−S:xp_max+S) = c(xp_min−S:xp_max+S) + c_part; n(xp_min−S :xp_max+S) = n(xp_min−S:xp_max+S) + ones(xp_max− xp_min+1+2*S); %n . . . normalization of coefficients because of overlapping end c = c ./ n; %normalization of coefficients because of overlapping % calculation of the reconstruction for i = 1 : length(x_rec) for j = floor(x_rec(i)−S) : ceil(x_rec(i)+S) % |x_rec−j| <= S f_rec(x_rec(i)) = f_rec(x_rec(i)) + gen(x_rec(i)−j) * c(j); end end

While this exemplary code is written in C language, it can be written in other languages such as Fortran, Pascal, C++, or the like so long as it can be executed by at least one computer such as Computer 8.

While there has been shown various embodiments of the present invention, it is to be understood that certain changes can be made in the form and arrangement of the elements of the system and steps of the methods to practice the present invention as would be known to one skilled in the art without departing from the underlying scope of the invention as is particularly set forth in the claims. Furthermore, the embodiments described above are only intended to illustrate the principles of the present invention and are not intended to limit the claims to the disclosed elements.

LIST OF REFERENCES

-   [1] A. ALDROUBI, Non-Uniform Weighted Average Sampling and Exact     Reconstruction in Shift-Invariant Spaces, preprint, 2001. -   [2] A. ALDROUBI, Portraits of frames, Proc. Amer. Math. Soc., 123     (1995), pp. 1661-1668. -   [3] A. ALDROUBI, Oblique projections in atomic spaces, Proc. Amer.     Math. Soc., 124 (1996), pp. 2051-2060. -   [4] A. ALDROUBI AND H. FEIGHTINGER. Exact iterative reconstruction     algorithm for multivariate irregularly sampled functions in     spline-like spaces: The L˜theory, Proc. Amer. Math. Soc., 126     (1998), pp. 2677-2686. -   [5] A. ALDROUBI AND K. GRÖCHENIG, Nonuniform sampling and     reconstruction in shift variant space, SIAM Rev. 43 (2001), No. 4,     pp. 585-620. -   [6] A. ALDROUBI. Q. SUN AND W. S. TANG, p-frames and shift invariant     spaces of LP, J. Fourier Anal. Appl., 7 (2001), pp. 1-21. -   [7] A. ALDROUBI AND M. UNSER. Families of wavelet transforms in     connection with Shannon's sampling theory and the Gabor transform,     in Wavelets: A Tutorial in Theory and Applications, C. K. Chul. ed.,     Academic Press. San Diego, Calif., 1992, pp. 509-528. -   [8] A. ALDROUBI AND M. UNSER, Families of multiresolution and     wavelet spaces with optimal properties, Numer. Funct. Anal. Optim.,     14 (1993), pp. 417-446. -   [9] A. ALDROUBI AND M. UNSER, Sampling procedure in function spaces     and asymptotic equivalence with Shannon's sampling theory, Numer.     Funct. Anal. Optim., 15 (1994), pp. 1-21. -   [10] A. ALDROUBI. M. UNSER AND M. EDEN, Asymptotic properties of     least square spline filters and application to multi-scale     decomposition of signals, in Proceedings of the International     Conference on Information Theory and Its Applications, Waikiki, Hi.,     1990, pp. 271-274. -   [11] A. ALDROUBI. M. UNSER AND M. EDEN, Cardinal spline filters:     Stability and convergence to the ideal sinc interpolator, Signal     Processing, 28 (1992), pp. 127-138. -   [12] R. BALAN, Equivalence relations and distances between Hilbert     frames, Proc. Amer. Math. Soc., 127 (1999), pp. 2353-2366. -   [13] E. BELLER AND G. DE HAAN, New algorithms for motion estimation     on interlaced video, in Proc. SPIE-Visual Communication and Image     Processing, 3309 (1998), pp. 111-121. -   [14] J. J. BENEDETTO, Irregular sampling and frames, in Wavelets: A     Tutorial in Theory and Applications. C. K. Chui, ed., Academic     Press. San Diego, Calif., 1992, pp. 445-507. -   [15] J. J. BENEDETTO, Frame decompositions, sampling, and     uncertainty principle inequalities, in Wavelets-Mathematics and     Applications, J. J. Benedetto and M. W. Frazier, eds., CRC, Boca     Raton, Fla., 1993, pp. 247-304. -   [16] J. J. BENEDETTO AND P. J. S. G. FERREIRA, Modern Sampling     Theory, Birkhäuser, Boston, 2000. -   [17] J. J. BENEDETTO AND M. W. FRAZIER. ED., Wavelets-Mathematics     and Applications, CRC, Boca Raton, Fla., 1993. -   [18] J. J. BENEDETTO, C. HEIL. AND D. F. WALNUT, Gabor systems and     the Ealian-Low theorem, in Gabor Analysis and Algorithms, H. G.     Feichtinger and T. Strohmer, eds., Birkhäuser, Boston, 1998, pp.     85-122. -   [19] J. J. BENEDETTO AND S. Li, The theory of multiresolution frames     and applications to filter banks, Appl. Comput. Harmon. Anal., 5     (1998), pp. 389-427. -   [20] J. J. BENEDETTO AND D. WALNUT, Gabor frames of L ² and related     spaces, in Wavelets-Mathematics and Applications, J. J. Benedetto     and M W. Frazier, eds., CRC, Boca Raton, Fla., 1993, pp. 247-304. -   [21] J. J. BENEDETTO AND H.-C. Wu, Non-uniform sampling and spiral     MRI reconstruction, in Proc. SPIE-Wavelet Applications in Signal and     Image Processing VIII, 4119 (2000), pp. 130-141. -   [22] C. A. BERNSTEIN AND E. V. PATRICK, Exact deconvolution for     multiple convolution operators-an overview, plus performance     characterizations for imaging sensors, in Proceedings in     Multidimensional Signal Processing, IEEE, Piscataway, N.J., 1990,     pp. 723-734. -   [23] A. BEURLING, The Collected Works of Arne Beurling. Vol. 1,     Complex Analysis, L. Carleson, P. Malliavin, J. Neuberger, and J.     Wermer, eds., Birkhäuser, Boston, 1989. -   [24] A. BEURLING, The Collected Works of Arne Beurling. Vol. 2,     Harmonic Analysis, L. Carleson, P. Malliavin, J. Neuberger, and J.     Wermer, eds., Birkhäuser, Boston, 1989. -   [25] A. BEURLING AND P. MALLIAVIN, On the closure of characters and     the zeros of entire functions, Acta Math., 118 (1967), pp. 79-93. -   [26] T. BLU AND M. UNSER, Quantitative Fourier analysis of     approximation techniques: Part I—interpolators and projectors, IEEE     Trans. Signal Process., 47 (1999), pp. 2783-2795. -   [27] P. L. BUTZER, A survey of the Whittaker-Shannon sampling     theorem and some of its extensions, J. Math. Res. Exposition, 3     (1983), pp. 185-212. -   [28] P. G. CASAZZA AND O. CHRISTENSEN, Frames containing a Riesx     basis and preservation of this property under perturbations, SIAM J.     Math. Anal., 29 (1998), pp. 266-278. -   [29] P. CASAZZA, D. RAN AND D. LARSON, Frames for Banach spaces, in     The Functional and Harmonic Analysis of Wavelets and Frames,     Contemp. Math. 247, AMS, Providence, R.I., 1999, pp. 149-182. -   [30] W. CHEN, S. ITOH AND J. SHIKI, Irregular sampling theorems for     wavelet subspaces, IEEE Trans. Inform. Theory, 44 (1998), pp.     1131-1142. -   [31] O. CHRISTENSEN, Moment problems for frames and applications to     irregular sampling and Gabor frames, Appl. Comput. Harmon. Anal., 3     (1996), pp. 82-86. -   [32] C. K. CHUI, ED., Wavelets: A Tutorial in Theory and     Applications, Academic Press, San Diego, Calif., 1992. -   [33] I. DAUBEGHIES, Ten Lectures on Wavelets, SIAM, Philadelphia,     1992. -   [34] C. DE BOOR, R. DEVORE AND A. RON, The structure of finitely     generated shift-invariant spaces in L ₂(R ^(d)), J. Funct. Anal.,     119 (1994), pp. 37-78. -   [35] C. DE BOOR AND R. DEVORE, Partition of unity and approximation,     Proc. Amer. Math. Soc., 93 (1985), pp. 705-709. -   [36] R. A. DEVORE, B. JAWERTH AND B. J. LUCIER, Image compression     through wavelet transform coding, IEEE Trans. Inform. Theory, 38     (1992), pp. 719-746. -   [37] I. DJOKOVIC AND P. P. VAIDYANATHAN, Generalized sampling     theorems in multiresolution subspaces, IEEE Trans. Signal Process.,     45 (1997), pp. 583-599. -   [38] Y. DOMAR, Harmonic analysis based on certain commutative Banach     algebras, Acta Math., 96 (1956), pp. 1-66. -   [39] C. C. DONOVAN, J. S. GERONIMO AND D. P. HARDIN, Intertwining     multiresolution analyses and the construction of     piecewise-polynomial wavelets, SIAM J. Math. Anal., 27 (1996), pp.     1791-1815. -   [40] R. J. DUFFIN AND A. C. SCHAEFFER, A class of nonharmonic     Fourier series, Trans. Amer. Math. Soc., 72 (1952), pp. 341-3⁶⁶. -   [41] H. G. FEICHTINGER, Gewichtsfunktionen auf lokalkompakten     Gruppen, Sitzber. d. Österr. Akad. Wiss., 188 (1979), pp. 451-471. -   [42] H. G. FEICHTINGER, Banach convolution algebras of Wiener type,     in Functions, Series, Operators, Vols. I, H (Budapest, 1980),     North-Holland, Amsterdam, 1983, pp. 509-524. -   [43] H. G. FEICHTINGER, Generalized amalgams, with applications to     Fourier transform, Canad. J. Math., 42 (1990), pp. 395-409. -   [44] H. G. FEICHTINGER, New results on regular and irregular     sampling based on Wiener amalgams, in Proc. Conf. Function     Spaces, K. Jarosz, ed., Lecture Notes in Math. 136, Springer-Verlag,     New York, 1991, pp. 107-121. -   [45] H. G. FEICHTINGER, Wiener amalgams over Euclidean spaces and     some of their applications, in Proc. Conf. Function Spaces. K.     Jarosz, ed., Lecture Notes in Math. 136, Springer-Verlag, New York,     1991, pp. 123-137. -   [46] H. G. FEICHTINGER AND K. GRÖCHENIG, Banach spaces related to     integrable group representations and their atomic decompositions,     I, J. Funct. Anal., 86 (1989), pp. 307-340. -   [47] H. G. FEICHTINGER AND K. GRÖCHENIG, Iterative reconstruction of     multivariate band-limited functions from irregular sampling values,     SIAM J. Math. Anal., 23 (1992), pp. 244-261. -   [48] H. G. FEICHTINGER AND K. GRÖCHENIG, Theory and practice of     irregular sampling, in Wavelets-Mathematics and Applications. J. J.     Benedetto and W. Frazier, eds., CRC, Boca Raton, Fla., 1993, pp.     305-363. -   [49] H. G. FEICHTINGER. K. GRÖCHENIG, AND T. STROHMER, Efficient     numerical methods in non-uniform sampling theory, Numer. Math., 69     (1995), pp. 423-440. -   [50] H. G. FEICHTINGER AND T. STROHMER. EDS., Gabor Analysis and     Algorithms, Birkhäuser, Boston, 1998. -   [51] S. S. GOH AND I. G. H. ONG, Reconstruction of bandlimited     signals from irregular samples, Signal Process., 46 (1995), pp.     315-329. -   [52] T. N. T. GOODMAN, S. L. LEE AND W. S. TANG, Wavelet bases for a     set of commuting unitary operators, Adv. Comput. Math. 1 (1993), pp.     109-126. -   [53] T. N. T. GOODMAN, S. L. LEE AND W. S. TANG, Wavelet wandering     subspaces, Trans. Amer. Math. Soc., 338 (1993), pp. 639-654. -   [54] K. GRÖCHENIG, Describing functions: Atomic decompositions     versus frames, Monatsh. Math., 112 (1991), pp. 1-42. -   [55] K. GRÖCHENIG, Reconstruction algorithms in irregular sampling,     Math. Comp., 59 (1992), pp. 181-194. -   [56] K. GRÖCHENIG, Acceleration of the frame algorithm, IEEE Trans.     Signal Process., Special Issue on Wavelets and Signal Processing, 41     (1993), pp. 3331-3340. -   [57] K. GRÖCHENIG, Invertibility of the Frame Operator and Banach     Frames, preprint, 2001. -   [58] K. GRÖCHENIG AND H. RAZAFINJATOVO, On Landau's necessary     density conditions for sampling and interpolation of band-limited     functions, J. London Math. Soc., 54 (1996), pp. 557-565. -   [59] K. GRÖCHENIG AND T. STROHMER, Numerical and theoretical aspects     of non-uniform sampling of band-limited images, in Theory and     Practice of Nonuniform Sampling, F. Marvasti, ed., Kluwer/Plenum,     New York. 2001, in press. -   [60] C. E. HEIL AND D. F. WALNUT, Continuous and discrete wavelet     transforms, SIAM Rev., 31 (1989), pp. 628-666. -   [61] J. R. HIGGINS, Five short stories about the cardinal series,     Bull. Amer. Math. Soc., 121 (1985), pp. 45-89. -   [62] J. R. HIGGINS, Sampling theory for Paley-Wiener spaces in the     Riesz basis settings, Proc. Roy. Irish Acad. Sect., 2 (1994), pp.     219-235. -   [63] H. S. Hou AND H. C. ANDREWS, Cubic splines for image     interpolation and digital filtering, IEEE Trans. Acoust. Speech     Signal Process. 26 (1978), pp. 508-517. -   [64] A. J. E. M. JANSSEN, The Zak transform and sampling theorems     for wavelet subspaces, IEEE Trans. Signal Process., 41 (1993), pp.     3360-3364. -   [65] A. JERRI, The Shannon sampling theorem-its various extensions     and applications: A tutorial review, Proc. IEEE, 65 (1977), pp.     1565-1596. -   [66] K. JETTER AND J. STÖCKLER, Topics in scattered data     interpolation and non-uniform sampling, in Surface Fitting and     Multiresolution Methods, A. Le Mehautee, C. Rabut, and L. L.     Schumaker, eds., Vanderbilt University Press, Nashville, Tenn.,     1997, pp. 191-207. -   [67] R.-Q. JIA, Shift-invariant spaces and linear operator     equations, Israel Math. J., 103 (1998), pp. 259-288. -   [68] R.-Q. JIA, Stability of the shifts of a finite number of     functions, J. Approx. Theory, 95 (1998), pp. 194-202. -   [69] R.-Q. JIA AND C. A. MICCHELLI, On linear independence of     integer translates of a finite number of functions, Proc. Edinburgh     Math. Soc., 36 (1992), pp. 69-85. -   [70] P. JORGENSEN, A geometric approach to the cascade approximation     operator for wavelets, Integral Equations Operator Theory, 35     (1999), pp. 125-171. -   [71] M I. KADEG, The exact value of the Paley-Wiener constant,     Soviet Math. DokI., 5 (1964), pp. 559-561. -   [72] H. P. KRAMER, A generalized sampling theorem, J. Math. Phys.,     38 (1959), pp. 68-72. -   [73] H. LANDAU, A sparse regular sequence of exponentials closed on     large sets, Bull. Amer. Math. Soc., 70 (1964), pp. 566-569. -   [74] H. LANDAU, Necessary density conditions for sampling and     interpolation of certain entire functions, Acta Math., 117 (1967),     pp. 37-52. -   [75] S. Li, Iterative Irregular Sampling and Useful Irregular     Sampling Conditions, preprint. -   [76] Y. Liu, Irregular sampling for spline wavelet subs paces, IEEE     Trans. Inform. Theory, 42 (1996), pp. 623-627. -   [77] Y. Liu AND G. G. WALTER, Irregular sampling in wavelet subs     paces, J. Fourier Anal. Appl., 2 (1996), pp. 181-189. -   [78] Y. LYUBARSKI{hacek over (I)} AND W. R. MADYCH, The recovery of     irregularly sampled band limited junctions via tempered splines, J.     Funct. Anal., 125 (1994), pp. 201-222. -   [79] Y. LYUBARSKI{hacek over (I)} AND K. SEIP, Convergence and     summability of Gabor expansions at the Nyqyuist density, J. Fourier     Anal. AppI., 5 (1999), pp. 127-157. -   [80] S. MALLAT, Multiresolution approximations and wavelet     orthonormal bases of L ²(R), Trans. Amer. Math. Soc., 315 (1989),     pp. 69-97. -   [81] S. MALLAT, A theory for multiresolutiori signal decomposition:     The wavelet representation, IEEE Trans. PAMI, 11 (1989), pp.     674-693. -   [82] S. MALLAT, A Wavelet Tour, Academic Press, New York, 1996. -   [83] Y. MEYER, Ondelettes et Opérateurs, Hermann, Paris, France,     1990. -   [84] M. Z. NASHED AND G. G. WALTER, General sampling theorems for     functions in reproducing kernel Hilbert spaces, Math. Control     Signals Systems, 4 (1991), pp. 363-390. -   [85] J. P. OAKLEY, M. J. CUNNIGHAM AND G. LITTLE, A Fourier-domain     formula for the least squares projection of a function onto a     repetitive basis in N-dimensional space, IEEE Trans. Acoust. Speech     Signal Process., 38 (1990), pp. 114-120. -   [86] J. L. OSTUNI, A. K. S. SANTHAAND, V. S. MATTAY, D. R.     WEINBERGER, R. L. LEVIN AND J. A. FRANK, Analysis of interpolation     effects in the reslicing of functional MR-Images, J. Computer     Assisted Tomography, 21 (1997), pp. 803-810. -   [87] R. E. A. C. PALEY AND N. WIENER, Fourier transform in the     complex domain, in Amer. Math. Soc. Colloq. PubI., AMS, Providence,     R.I., 1934. -   [88] A. PAPOULIS, Generalized sampling expansions, Circuits Systems,     24 (1977), pp. 652-654. -   [89] B. S. PAVLOV, The basis property of a system of exponential.s     and the condition of Muckenhoupt, Dokl. Akad. Nauk SSSR, 247 (1979),     pp. 37-40. -   [90] D. POTTS AND C. STEIDL, New Fourier reconstruction algorithms     for computerized tomography, in Proc. Wavelet Applications in Signal     and Image Processing VIII, 4199 (2000), pp. 13-23. -   [91] H. REITER, Classical Harmonic Analysis and Locally Compact     Groups, Oxford Univ. Press, Oxford, UK, 1968. -   [92] M. RAUTH AND T. STROHMER, Smooth approximation of potential     fields from noisy scattered data, Geophysics, 63 (1998), pp. 85-94. -   [93] K. SKIP, An irregular sampling theorem for functions     bandlemeted en a generalezed sense, SIAM J. Appl. Math., 47 (1987),     pp. 1112-1116. -   [94] K. SKIP, On the connection between exponential bases and     certain related sequences in L ²(−π, π), J. Funct. Anal., 130     (1995), pp. 131-160. -   [95] I. W. SELESNICK, Interpolating multiwavelet and the sampling     theorem, IEEE Trans. Signal Process., 46 (1999), pp. 2898-2908. -   [96] C. E. SHANNON, Communications in the presence of noise, Proc.     IRE, 37 (1949), pp. 10-21. -   [97] J. STÖCKLER, Multivariate Affine Frames, Shaker Verlag, Aachen,     Germany, 1998. -   [98] G. STRANG, The finite element method and approximation theory,     in Proc. Sympos. Numerical Solution of Partial Differential     Equations, Academic Press, New York, 11(1971), pp. 547-583. -   [99] G. STRANG, Wavelets and dilation equations: A brief     introduction, SIAM Rev., 31 (1989), pp. 614-627. -   [100] G. STRANG AND T. NGUYEN, Wavelets and Filter Banks,     Wellesley-Cambridge Press, Wellesley, Mass., 1996. -   [101] T. STROHMER, Numerical analysis of the non-uniform sampling     problem, J. Comput. Appi. Math., 122 (2000), pp. 297-316. -   [102] W. SUN AND X. ZHOU, On the stability of multivariate     trigonometric systems, J. Math. Anal. Appl., 235 (1999), pp.     159-167. -   [103] P. THÉVENAZ, T. BLU, AND M. UNSER, Image interpolation and     resampling, in Handbook of Medical Image Processing, Processing and     Analysis, I. N. Bankman, ed., Academic Press, San Diego, Calif.     2000, pp. 393-420. -   [104] C. THOMAS, A comparison of motion-compensated     interlace-to-progressive conversion methods, Image Communication, 12     (1998), pp. 209-229. -   [105] M. UNSER AND A. ALDROUBI, Polynomial splines and wavelets-a     signal processing perspective, in Wavelets: A Tutorial in Theory and     Applications, C. K. Chui, ed., Academic Press, San Diego, Calif.,     1992, pp. 543-601. -   [106] M. UNSER AND A. ALDROUBI, Ceneralized sampling with     application to the wavelet transform, in Proceedings of the     Conference on Information Sciences and Systems, The Johns Hopkins     University Press, Baltimore, Md., 1993. -   [107] M. UNSER AND A. ALDROUBI, A general sampling theory for     non-ideal acquisition devices, IEEE Trans. Signal Process., 42     (1994), pp. 2915-2925. -   [108] M. UNSER, A. ALDROUBI, AND M. EDEN, A sampling theory for     polynomial splines, in Proceedings of the International Conference     on Information Theory and Its Applications, Waikiki, Hi., 1990, pp.     279-282. -   [109] M. UNSER, A. ALDROUBI, AND M. EDEN, Polynomial spline signal     approximations: Filter design and asymptotic equivalence with     Shannon's sampling theorem, IEEE Trans. Image Process., 38 (1992),     pp. 95-103. -   [110] M. UNSER AND J. ZERUBIA, A generalized sampling theory without     bandlimiting constraints, Trans. Circuits and Systems-II: Analog and     Digital Signal Processing, 45 (1998), pp. 959-969. -   [111] R. VIO, T. STROHMER. AND W. WAMSTEKER. On the reconstruction     of irregularly sampled time series. PubI. Astronom. Soc. Pac., 112     (2000), pp. 74-90. -   [112] D. WALUNT, Nonperiodic sampling of bandlimited functions on     union of rectangular, J. Fourier Anal. Appl., 2 (1996), pp. 436-451. -   [113] G. G. WALTER, A sampling theorem for wavelet subspaces, IEEE     Trans. Inform. Theory, 38 (1992), pp. 881-884. -   [114] J. M. WHITTAKER, Interpolatory Function Theory, Cambridge     University Press, London, 1935. -   [115] X. G. XIA, J. S. CERONIMO, D. P. HARDIN AND B. W. SUTTER,     Design of prefilters for discrete multiwavelet transforms, IEEE     Trans. Signal Process., 44 (1996), pp. 25-35. -   [116] X.G. XIA AND Z.Z. ZHANG, On sampling theorem, wavelets, and     wavelet transforms, IEEE Trans. Signal Process., 41(1993), pp.     3524-3535. -   [117] K. YAO, Applications of reproducing kernel Hilbert     spaces-bandlimited signal models, Inform. and Control, 11 (1967),     pp. 429-444. -   [118] R. M. YOUNG, An Introduction to Nonharmonic Fourier Series,     Academic Press, New York, 1980. -   [119] X. ZHOU AND W. SUN, On the sampling theorem for wavelet     subspaces, J. Fourier Anal. Appl., 5 (1999), pp. 347-354. -   [120] A. ALDROUBI AND K. GROCHENIG, Beurling-Landau-type theorems     for non-uniform sampling in shift invariant spline spaces, J.     Fourier Anal. Appl. 6 (2000), pp. 93-103. -   [121] M. D. BUHMANN, Radial basis functions, Acta numerica, (2000)     Cambridge Univ. Press, Cambridge, pp. 1-38. -   [122] P. CRAVEN AND GRACE WAHBA, Smoothing noisy data with spline     functions. Estimating the correct degree of smoothing by the method     of generalized cross-validation, Numer. Math. 31, (1978/79), pp.     377-403 -   [123] S. DEMKO, W. F. Moss AND P. W. SMITH, Decay rates for inverses     of band matrices, Math. Comp. 43 (1984), pp. 491-499. -   [124] G. H. GOLUB AND C. F. VAN LOAN, Matrix computations, third     ed., Johns Hopkins Universtiy Press, Baltimore, Md. (1996) -   [125] M. F. HUTCHINSON AND F. R. DEHOOG, Smoothing noisy data with     spline functions, Numer. Math., 47 (1985), pp. 99-106 -   [126] S. JAFFARD, Propriétés des matrices “bien localisées” près de     leur diagonale et quelques applications, Ann. Inst. H. Poincaré     Anal. Non Liéaire, 7, (1990), pp. 461-476 -   [127] L. L. SCHUMAKER, Spline functions: basic theory, John Wiley &     Sons Inc., New York, 1981, Pure and Applied Mathematics, A     Wiley-Interscience Publication. -   [128] G. WAHBA, Spline models for observational data, Society for     Industrial and Applied Mathematics SIAM, Philadelphia, Pa. (1990) 

1. A method for recovering information about an object of interest ƒ from a data set {f(x_(j))} obtained from nonuniform data sample points x_(j)εX, j being an indexing number, X representing the set of points where the object of interest ƒ is sampled, comprising the steps of: a. selecting data ƒ(x_(j)) from the data set {ƒ(x_(j))}; b. constructing an approximation operator Q_(X); c. applying the approximation operator Q_(X) to the data ƒ(x_(j)) to obtain an approximation Q_(X)ƒ(x_(j)); d. constructing a projection operator P; e. applying the projection operator P to the approximation Q_(X)ƒ(x_(j)) to obtain a first approximations ƒ₁=P Q_(X)ƒ(x_(j)); f. obtaining an error e=ƒ(x_(j))−ƒ₁; g. applying the projection operator P to the error e to obtain a first approximation of error e₁=P e; h. obtaining a second approximations ƒ₂=ƒ₁+e₁; i. returning to step (e) until a sequence ƒ_(n)=ƒ₁+e₁+e₂+e₃+AAA+e_(n−1) is obtained, wherein function ƒ_(n) converges to the object of interest ƒ; and j. outputting the obtained sequence ƒ_(n), wherein the outputting step comprises at least one step of: (A) displaying the obtained sequence ƒ_(n) in a display with a GUI; (B) storing the obtained sequence ƒ_(n) in the computer readable medium, a memory device, or a network device; (C) transmitting the obtained sequence ƒ_(n) over network to a network device; and (D) printing the obtained sequence ƒ_(n) in a printer.
 2. The method of claim 1, wherein the approximation operator Q_(X) comprises an interpolation operator.
 3. The method of claim 2, wherein the interpolation operator provides piecewise linear interpolation.
 4. The method of claim 2, wherein the approximation operator Q_(X) comprises a quasi-interpolation operator.
 5. The method of claim 4, wherein the quasi-interpolation operator provides step-wise approximation.
 6. The method of claim 1, wherein the projection operator P comprises a bounded projection.
 7. The method of claim 1, wherein the projection operator P comprises a universal projection.
 8. The method of claim 1, wherein the data set {f(x_(j))} comprises a plurality of digital data related to sound.
 9. The method of claim 1, wherein the data set {f(x_(j))} comprises a plurality of digital data related to at least one image.
 10. The method of claim 9, wherein the at least one image is one of a plurality of magnetic resonance image, a plurality of computerized tomography images, a plurality of optical image, a plurality of ultra sound images, a plurality of electronic images that are transmittable over a network, a plurality of satellite images, a plurality of three-dimensional images, a plurality of spectral images, a plurality of n-dimensional images with n being an integer greater than 1, or any combination of them.
 11. The method of claim 1, wherein the data set {f(x_(j))} comprises a plurality of biological data.
 12. The method of claim 11, wherein the plurality of biological data contain a plurality of data from the group of a plurality of biological data related to genes, a plurality of biological data related to proteins, a plurality of biological data related to cells, a plurality of biological data related to bacteria, or a plurality of biological data related to tissues.
 13. The method of claim 1, wherein the data set {f(x_(j))} comprises a plurality of data from at least one measurement of the object of the interest.
 14. The method of claim 13, wherein the at least one measurement is one of at least one astronomical measurement, at least one seismic measurement, at least one marine measurement, at least one geophysical measurement, at least one atmospheric measurement, at least one engineering measurement, at least one physical measurement, or at least one chemical measurement.
 15. The method of claim 1, wherein the data set {f(x_(j))} comprises a plurality of data related to time dependent signals.
 16. A system for recovering information about an object of interest ƒ from a data set {f(x_(j))} obtained from nonuniform data sample points x_(j)εX, j being an indexing number, X representing the set of points where the object of interest ƒ is sampled, comprising: (i). an input device for receiving the information in the data set {f(x_(j))}; and (ii). a processor communicating to the input device and performing the steps of: a. selecting data ƒf(x_(j)) from the data set {ƒ(x_(j))}; b. constructing an approximation operator Q_(X); c. applying the approximation operator Q_(X) to the data ƒ(x_(j)) to obtain an approximation Q_(X) ƒ(x_(j)); d. constructing a projection operator P; e. applying the projection operator P to the approximation Q_(X)ƒ(x_(j)) to obtain a first approximation ƒ₁=PQ_(X)ƒ(x_(j)); f. obtaining an error e=ƒ(x_(j))−ƒ₁; g. applying the projection operator P to the error e to obtain a first approximation of error e₁=P e; h. obtaining a second approximation ƒ₂=ƒ₁+e₁; i. returning to step (e) until a sequence ƒ_(n)=ƒ₁+e₁+e₂+e₃+AAA+e_(n−1) is obtained, wherein function ƒ_(n) converges to the object of interest ƒ; and j. outputting the obtained sequence ƒ_(n), wherein the outputting step comprises at least one step of; (A) displaying the obtained sequence ƒ_(n) in a display with a graphic-user interface (GUI); (B) storing the obtained sequence ƒ_(n) in the computer readable medium, a memory device, or a network device; (C) transmitting the obtained sequence ƒ_(n) over network to a network device; and (D) printing the obtained sequence ƒ_(n) in a printer.
 17. The system of claim 16, wherein the approximation operator Q_(X) comprises an interpolation operator.
 18. The system of claim 17, wherein the interpolation operator provides piecewise linear interpolation.
 19. The system of claim 17, wherein the approximation operator Q_(X) comprises a quasi-interpolation operator.
 20. The system of claim 19, wherein the quasi-interpolation operator provides step-wise approximation.
 21. The system of claim 16, wherein the projection operator P comprises a bounded projection.
 22. The system of claim 16, wherein the projection operator P comprises a universal projection.
 23. The system of claim 16, wherein the processor comprises a microprocessor.
 24. The system of claim 16, wherein the input device comprises at least one device selected from the group of a processor interface, a GUI, a scanner, a CD-ROM, a diskette, a computer coupled to a network, and a networking device.
 25. The system of claim 16, further comprising an output device coupled to the processor for receiving the obtained sequence.
 26. The system of claim 25, wherein the output device comprises at least one device selected from the group of a GUI, a printer, a CD-ROM, a diskette, a memory device, a computer coupled to a network, and a networking device.
 27. The system of claim 16, wherein the data set {f(x_(j))} comprises a plurality of digital data related to sound.
 28. The system of claim 16, wherein the data set {f(x_(j))} comprises a plurality of digital data related to at least one image.
 29. The system of claim 28, wherein the at least one image is one of a plurality of magnetic resonance image, a plurality of computerized tomography images, a plurality of optical image, a plurality of ultra sound images, a plurality of electronic images that are transmittable over a network, a plurality of satellite images, a plurality of three-dimensional images, a plurality of spectral images, a plurality of n-dimensional images with n being an integer greater than 1, or any combination of them.
 30. The system of claim 16, wherein the data set {f(x_(j))} comprises a plurality of biological data.
 31. The system of claim 30, wherein the plurality of biological data contain a plurality of data from the group of a plurality of biological data related to genes, a plurality of biological data related to proteins, a plurality of biological data related to cells, a plurality of biological data related to bacteria, or a plurality of biological data related to tissues.
 32. The system of claim 16, wherein the data set {f(x_(j))} comprises a plurality of data from at least one measurement of the object of the interest.
 33. The system of claim 32, wherein the at least one measurement is one of at least one astronomical measurement, at least one seismic measurement, at least one marine measurement, at least one geophysical measurement, at least one atmospheric measurement, at least one engineering measurement, at least one physical measurement, or at least one chemical measurement.
 34. The system of claim 16, wherein the data set {f(x_(j))} comprises a plurality of data related to time dependent signals.
 35. A method for recovering information about an object of interest ƒ from a data set {f(x_(j))} obtained from nonuniform data sample points x_(j)εX, j being an indexing number, X representing the set of points where the object of interest ƒ is sampled in presence of noise, comprising: a. selecting data ƒ_(j)′ from the data set {ƒ_(j)′=ƒ(x_(j))+η_(j)}, wherein η_(j) represents a corresponding noise component; b. constructing an initialization function ƒ′ as the summation of function f_(j)′:ƒ′=3_(OJ)ƒ_(j)′β_(j), wherein β_(j) represents the jth component of a partition of unity; c. constructing an approximation operator Q_(X); d. applying the approximation operator Q_(X) to the function ƒ′ to obtain an approximation Q_(X)ƒ′; e. constructing a projection operator P; f. applying the projection operator P to the approximation Q_(X)ƒ′ to obtain a first approximation ƒ₁=P Q_(X)ƒ′; g. obtaining an error e=ƒ−ƒ₁; h. applying the projection operator P to the error e to obtain a first approximation of error e₁=P e; i. obtaining a second approximation ƒ₂=ƒ₁+e₁; j. returning to step (f) until a sequence ƒ_(n)=ƒ₁+e₁+e₂+e₃+AAA+e_(n−1) is obtained, wherein function ƒ_(n) converges to a function ƒ that adequately describes the object of interest ƒ; and k. outputting the obtained sequence ƒ_(n), wherein the outputting step comprises at least one step of: (A) displaying the obtained sequence ƒ_(n) in a display with a graphic-user interface (GUI); (B) storing the obtained sequence ƒ_(n) in the computer readable medium, a memory device, or a network device; (C) transmitting the obtained sequence ƒ_(n) over network to a network device; and (D) printing the obtained sequence ƒ_(n) in a printer.
 36. The method of claim 35, wherein the approximation operator Q_(X) comprises an interpolation operator.
 37. The method of claim 36, wherein the interpolation operator provides piecewise linear interpolation.
 38. The method of claim 35, wherein the approximation operator Q_(X) comprises a quasi-interpolation operator.
 39. The method of claim 38, wherein the quasi-interpolation operator provides step-wise approximation.
 40. The method of claim 35, wherein the projection operator P comprises a bounded projection.
 41. The method of claim 35, wherein the projection operator P comprises a universal projection.
 42. The method of claim 35, wherein the function ƒ_(∞) satisfies the relationship of P Q_(X)f_(∞)=P Q_(X){f_(j)′}.
 43. The method of claim 35, wherein the data set {f(x_(j))} comprises a plurality of digital data related to sound.
 44. The method of claim 35, wherein the data set {f(x_(j))} comprises a plurality of digital data related to at least one image.
 45. The method of claim 44, wherein the at least one image is one of a plurality of magnetic resonance image, a plurality of computerized tomography images, a plurality of optical image, a plurality of ultra sound images, a plurality of electronic images that are transmittable over a network, a plurality of satellite images, a plurality of three-dimensional images, a plurality of spectral images, a plurality of n-dimensional images with n being an integer greater than 1, or any combination of them.
 46. The method of claim 35, wherein the data set {f(x_(j))} comprises a plurality of biological data.
 47. The method of claim 46, wherein the plurality of biological data contain a plurality of data from the group of a plurality of biological data related to genes, a plurality of biological data related to proteins, a plurality of biological data related to cells, a plurality of biological data related to bacteria, or a plurality of biological data related to tissues.
 48. The method of claim 35, wherein the data set {f(x_(j))} comprises a plurality of data from at least one measurement of the object of the interest.
 49. The method of claim 48, wherein the at least one measurement is one of at least one astronomical measurement, at least one seismic measurement, at least one marine measurement, at least one geophysical measurement, at least one atmospheric measurement, at least one engineering measurement, at least one physical measurement, or at least one chemical measurement.
 50. The method of claim 35, wherein the data set {f(x_(j))} comprises a plurality of data related to time dependent signals.
 51. A system for recovering information about an object of interest ƒ from a data set {f(x_(j))} obtained from nonuniform data sample points x_(j)εX, j being an indexing number, X representing the set of points where the object of interest ƒ is sampled in presence of noise, comprising: (i). an input device for receiving the information in the data set {f(x_(j))}; and (ii). a processor communicating to the input device and performing the steps of: a. selecting data ƒ_(j)′ from the data set {ƒ_(j)′=ƒ(x_(j))+η_(j)}, wherein η_(j) represents a corresponding noise component; b. constructing an initialization function ƒ′ as the summation of function ƒ_(j)′:ƒ′=3_(jOJ)ƒ_(j)′β_(j), wherein β_(j) represents the jth component of a partition of unity; c. constructing an approximation operator Q_(X); d. applying the approximation operator Q_(X) to the function ƒ′ to obtain an approximation Q_(X)ƒ′; e. constructing a projection operator P; f. applying the projection operator P to the approximation Q_(X)ƒ′ to obtain a first approximation ƒ₁=P Q_(X)ƒ′; g. obtaining an error e=ƒ−ƒ₁; h. applying the projection operator P to the error e to obtain a first approximation of error e₁=P e; i. obtaining a second approximation ƒ₂=ƒ₁+e₁; j. returning to step (f) until a sequence ƒ_(n)=ƒ₁+e₁+e₂+e₃+AAA+e_(n−1) is obtained, wherein function ƒ_(n) converges to a function ƒ_(∞) that adequately describes the object of interest ƒ; and k. outputting the obtained sequence ƒ_(n), wherein the outputting step comprises at least one step of: (A) displaying the obtained sequence ƒ_(n) in a display with a graphic-user interface (GUI); (B) storing the obtained sequence ƒ_(n) in the computer readable medium, a memory device, or a network device; (C) transmitting the obtained sequence ƒ_(n) over network to a network device; and (D) printing the obtained sequence ƒ_(n) in a printer.
 52. The system of claim 51, wherein the approximation operator Q_(X) comprises an interpolation operator.
 53. The system of claim 52, wherein the interpolation operator provides piecewise linear interpolation.
 54. The system of claim 51, wherein the approximation operator Q_(X) comprises a quasi-interpolation operator.
 55. The system of claim 54, wherein the quasi-interpolation operator provides step-wise approximation.
 56. The system of claim 51, wherein the projection operator P comprises a bounded projection.
 57. The system of claim 51, wherein the projection operator P comprises a universal projection.
 58. The system of claim 51, wherein the function f_(∞) satisfies the relationship of PQ_(X)ƒ_(∞)=PQ_(X){ƒ_(j)′}.
 59. The system of claim 51, wherein the processor comprises a microprocessor.
 60. The system of claim 51, wherein the input device comprises at least one device selected from the group of a processor interface, a GUI, a scanner, a CD-ROM, a diskette, a computer coupled to a network, and a networking device.
 61. The system of claim 51, further comprising an output device coupled to the processor for receiving the obtained sequence ƒ_(n).
 62. The system of claim 61, wherein the output device comprises at least one device selected from the group of a GUI, a printer, a CD-ROM, a diskette, a memory device, a computer coupled to a network, and a networking device.
 63. The system of claim 51, wherein the data set {ƒ_(j)′=ƒ(x_(j))+η_(j)} comprises a plurality of digital data related to sound.
 64. The system of claim 51, wherein the data set {ƒ_(j)′=ƒ(x_(j))+η_(j)} comprises a plurality of digital data related to at least one image.
 65. The system of claim 64, wherein the at least one image is one of a plurality of magnetic resonance image, a plurality of computerized tomography images, a plurality of optical image, a plurality of ultra sound images, a plurality of electronic images that are transmittable over a network, a plurality of satellite images, a plurality of three-dimensional images, a plurality of spectral images, a plurality of n-dimensional images with n being an integer greater than 1, or any combination of them.
 66. The system of claim 51, wherein the data set {ƒ_(j)′=ƒ(x_(j))+η_(j)} comprises a plurality of biological data.
 67. The system of claim 66, wherein the plurality of biological data contain a plurality of data from the group of a plurality of biological data related to genes, a plurality of biological data related to proteins, a plurality of biological data related to cells, a plurality of biological data related to bacteria, or a plurality of biological data related to tissues.
 68. The system of claim 51, wherein the data set {ƒ_(j)′=ƒ(x_(j))+η_(j)} comprises a plurality of data from at least one measurement of the object of the interest.
 69. The system of claim 68, wherein the at least one measurement is one of at least one astronomical measurement, at least one seismic measurement, at least one marine measurement, at least one geophysical measurement, at least one atmospheric measurement, at least one engineering measurement, at least one physical measurement, or at least one chemical measurement.
 70. The system of claim 51, wherein the data set {ƒ_(j)′=ƒ(x_(j))+η_(j)} comprises a plurality of data related to time dependent signals.
 71. A method for recovering information about an object of interest ƒ from a data set of averages {<f, ψ_(x) _(j) >} obtained from nonuniform data sample points x_(j)εX, j being an indexing number, X representing the set of points where the object of interest ƒ is sampled, comprising the steps of: a. selecting data <ƒ, ψ_(x) _(j) > from the data set {<ƒ, ψ_(x) _(j) >}; b. constructing a quasi-reconstruction operator A_(X) for obtaining a quasi-reconstruction A_(X)ƒ wherein A_(X)ƒ=3_(jOJ)<ƒ,ψ_(x) _(j) >β_(j), wherein β_(j) represents the jth component of a partition of unity, and {ψ_(x) _(k) :x_(j)εX} is a set of functionals that act on ƒ; c. constructing a projection operator P; d. applying the projection operator P to the quasi-reconstruction A_(X)ƒ to obtain a first approximation ƒ₁=PA_(X)ƒ; e. obtaining an error e=ƒ−ƒ₁; f. applying the projection operator P and the quasi-reconstruction operator A_(X) to the error e to obtain a first approximation of error e₁=P A_(X) e; g. obtaining a second approximation ƒ₂=ƒ₁+e₁; h. returning to step (e) until a sequence ƒ_(n)=ƒ₁+e₁+e₂+e₃+AAA+e_(n'1)=P A_(X)(ƒ−ƒ_(n−1))+ƒ_(n−1) is obtained, wherein function ƒ_(n) converges to the object of interest ƒ; and i. outputting the obtained sequence ƒ_(n), wherein the outputting step comprises at least one step of: (A) displaying the obtained sequence ƒ_(n) in a display with a graphic-user interface (GUI); (B) storing the obtained sequence ƒ_(n) in the computer readable medium, a memory device, or a network device; (C) transmitting the obtained sequence ƒ_(n) over network to a network device; and (D) printing the obtained sequence ƒ_(n) in a printer.
 72. The method of claim 71, wherein the data set of averages {<ƒ, ψ_(x) _(j) >} comprises a plurality of digital data related to sound.
 73. The method of claim 71, wherein the data set of averages {<ƒ, ψ_(x) _(j) >} comprises a plurality of digital data related to at least one image.
 74. The method of claim 73, wherein the at least one image is one of a plurality of magnetic resonance image, a plurality of computerized tomography images, a plurality of optical image, a plurality of ultra sound images, a plurality of electronic images that are transmittable over a network, a plurality of satellite images, a plurality of three-dimensional images, a plurality of spectral images, a plurality of n-dimensional images with n being an integer greater than 1, or any combination of them.
 75. The method of claim 71, wherein the data set of averages {<ƒ, ψ_(x) _(j) >} comprises a plurality of biological data.
 76. The method of claim 75, wherein the plurality of biological data contain a plurality of data from the group of a plurality of biological data related to genes, a plurality of biological data related to proteins, a plurality of biological data related to cells, a plurality of biological data related to bacteria, or a plurality of biological data related to tissues.
 77. The method of claim 71, wherein the data set of averages {<ƒ, ψ_(x) _(j) >} comprises a plurality of data from at least one measurement of the object of the interest.
 78. The method of claim 77, wherein the at least one measurement is one of at least one astronomical measurement, at least one seismic measurement, at least one marine measurement, at least one geophysical measurement, at least one atmospheric measurement, at least one engineering measurement, at least one physical measurement, or at least one chemical measurement.
 79. The method of claim 71, wherein the data set of averages {<ƒ, ψ_(x) _(j) >} omprises a plurality of data related to time dependent signals.
 80. A system for recovering information about an object of interest ƒ from a data set of averages {<ƒ, ψ_(x) _(j) >} obtained from nonuniform data sample points x_(j)εX, j being an indexing number, X representing the set of points where the object of interest ƒ is sampled, comprising: (i). an input device for receiving the information in the data set of averages {<ƒ, ψ_(x) _(j) >}; and (ii). a processor communicating to the input device and performing the steps of: a. selecting data <ƒ, ψ_(x) _(j) > from the data set {<ƒ, ψ_(x) _(j) >}; b. constructing a quasi-reconstruction operator A_(X) for obtaining a quasi-reconstruction A_(X)ƒ wherein A_(X)ƒ=3_(jOJ)<ƒ, ψ_(x) _(j) >β_(j), wherein β_(j)represents the jth component of a partition of unity, and {ψ_(x) _(j) :x_(j)εX} is a set of functionals that act on ƒ; c. constructing a projection operator P; d. applying the projection operator P to the quasi-reconstruction A_(X)ƒ to obtain a first approximation ƒ₁=PA_(X)ƒ; e. obtaining an error e=ƒ−ƒ₁; f. applying the projection operator P and the quasi-reconstruction operator A_(X) to the error e to obtain a first approximation of error e₁=P A_(X) e; g. obtaining a second approximation ƒ₂=ƒ₁+e₁; h. returning to step (e) until a sequence ƒ_(n)=ƒ₁+e₁+e₂+e₃+AAA+e_(n−1)=P A_(X)(ƒ−ƒ_(n−1))+ƒ_(n−1) is obtained, wherein function ƒ_(n) converges to the object of interest ƒ; and i. outputting the obtained sequence ƒ_(n), wherein the outputting step comprises at least one step of: (A) displaying the obtained sequence ƒ_(n) in a display with a graphic-user interface (GUI); (B) storing the obtained sequence ƒ_(n) in the computer readable medium, a memory device, or a network device; (C) transmitting the obtained sequence ƒ_(n) over network to a network device; and (D) printing the obtained sequence ƒ_(n) in a printer.
 81. The system of claim 80, wherein the processor comprises a microprocessor.
 82. The system of claim 80, wherein the input device comprises at least one device selected from the group of a processor interface, a GUI, a scanner, a CD-ROM, a diskette, a computer coupled to a network, and a networking device.
 83. The system of claim 80, further comprising an output device coupled to the processor for receiving the obtained sequence ƒ_(n).
 84. The system of claim 83, wherein the output device comprises at least one device selected from the group of a GUI, a printer, a CD-ROM, a diskette, a memory device, a computer coupled to a network, and a networking device.
 85. The system of claim 80, wherein the data set of averages {<ƒ, ψ_(x) _(j) >} comprises a plurality of digital data related to sound.
 86. The system of claim 80, wherein the data set of averages {<ƒ, ψ_(x) _(j) >} comprises a plurality of digital data related to at least one image.
 87. The system of claim 86, wherein the at least one image is one of a plurality of magnetic resonance image, a plurality of computerized tomography images, a plurality of optical image, a plurality of ultra sound images, a plurality of electronic images that are transmittable over a network, a plurality of satellite images, a plurality of three-dimensional images, a plurality of spectral images, a plurality of n-dimensional images with n being an integer greater than 1, or any combination of them.
 88. The system of claim 80, wherein the data set of averages {<ƒ, ψ_(x) _(j) >} comprises a plurality of biological data.
 89. The system of claim 88, wherein the plurality of biological data contain a plurality of data from the group of a plurality of biological data related to genes, a plurality of biological data related to proteins, a plurality of biological data related to cells, a plurality of biological data related to bacteria, or a plurality of biological data related to tissues.
 90. The system of claim 80, wherein the data set of averages {<ƒ, ψ_(x) _(j) >} comprises a plurality of data from at least one measurement of the object of the interest.
 91. The system of claim 90, wherein the at least one measurement is one of at least one astronomical measurement, at least one seismic measurement, at least one marine measurement, at least one geophysical measurement, at least one atmospheric measurement, at least one engineering measurement, at least one physical measurement, or at least one chemical measurement.
 92. The system of claim 80, wherein the data set of averages {<ƒ, ψ_(x) _(j) >} comprises a plurality of data related to time dependent signals.
 93. A method for recovering information about an object of interest ƒ from a data set of averages {<ƒ, ψ_(x) _(j) >} obtained from nonuniform data sample points x_(j)εX, j being an indexing number, X representing the set of points where the object of interest ƒ is sampled in presence of noise, comprising: a. selecting data ƒ_(j)′ from the data set {ƒ_(j)′=<ƒ,ψ_(x) _(j) >+η_(j)}, wherein η_(j) represents a corresponding noise component; b. constructing an initialization function ƒ′ as the summation of function ƒ_(j)′:ƒ′=3_(jOJ)ƒ_(j)′β_(j), wherein β_(j) represents the jth component of a partition of unity; c. constructing a quasi-interpolant operator Q_(X); d. applying the quasi-interpolant operator Q_(X) to the function ƒ′ to obtain an approximation Q_(X)ƒ′; e. constructing a projection operator P; f. applying the projection operator P to the approximation Q_(X)ƒ′ to obtain a first approximation ƒ₁=P Q_(X)ƒ′; g. obtaining an error e=ƒ−ƒ₁; h. constructing a quasi-reconstruction operator A_(X) for obtaining a quasi-reconstruction A_(X)ƒ, wherein A_(X)ƒ=3_(jOJ)<ƒ,ψ_(x) _(j) >β_(j), and {ψ_(x) _(j) :x_(j)εX} is a set of functionals that act on ƒ; i. applying the projection operator P and the quasi-reconstruction operator A_(X) to the error e to obtain a first approximation of error e₁=PA_(X)e; j. obtaining a second approximation ƒ₂=ƒ₁+e₁; k. returning to step (g) until a sequence ƒ_(n)=ƒ₁+e₁+e₂+e₃+AAA+e_(n−1)=ƒ₁+(I−PA_(X))ƒ_(n−1) is obtained, wherein I is an unit operator and function ƒ_(n) converges to a function ƒ that adequately describes the object of interest ƒ; and l. outputting the obtained sequence ƒ_(n), wherein the outputting step comprises at least one step of: (A) displaying the obtained sequence ƒ_(n) in a display with a graphic-user interface (GUI); (B) storing the obtained sequence ƒ_(n) in the computer readable medium, a memory device, or a network device; (C) transmitting the obtained sequence ƒ_(n) over network to a network device; and (D) printing the obtained sequence ƒ_(n) in a printer.
 94. The method of claim 93, wherein the data set {ƒ_(j)′=<ƒ,ψ_(x) _(j) >+η_(j)} comprises a plurality of digital data related to sound.
 95. The method of claim 93, wherein the data set {ƒ_(j)′=<ƒ,ψ_(x) _(j) >+η_(j)} comprises a plurality of digital data related to at least one image.
 96. The method of claim 95, wherein the at least one image is one of a plurality of magnetic resonance image, a plurality of computerized tomography images, a plurality of optical image, a plurality of ultra sound images, a plurality of electronic images that are transmittable over a network, a plurality of satellite images, a plurality of three-dimensional images, a plurality of spectral images, a plurality of n-dimensional images with n being an integer greater than 1, or any combination of them.
 97. The method of claim 93, wherein the data set {ƒ_(j)′=<ƒ,ψ_(x) _(j) >+η_(j)} comprises a plurality of biological data.
 98. The method of claim 97, wherein the plurality of biological data contain a plurality of data from the group of a plurality of biological data related to genes, a plurality of biological data related to proteins, a plurality of biological data related to cells, a plurality of biological data related to bacteria, or a plurality of biological data related to tissues.
 99. The method of claim 93, wherein the data set {ƒ_(j)′=<ƒ,ψ_(x) _(j) >+η_(j)} comprises a plurality of data from at least one measurement of the object of the interest.
 100. The method of claim 99, wherein the at least one measurement is one of at least one astronomical measurement, at least one seismic measurement, at least one marine measurement, at least one geophysical measurement, at least one atmospheric measurement, at least one engineering measurement, at least one physical measurement, or at least one chemical measurement.
 101. The method of claim 93, wherein the data set {ƒ_(j)′=<ƒ,ψ_(x) _(j) >+η_(j)} comprises a plurality of data related to time dependent signals.
 102. A system for recovering information about an object of interest ƒ from a data set of averages {<ƒ,ψ_(x) _(j) >} obtained from nonuniform data sample points x_(j)εX, j being an indexing number, X representing the set of points where the object of interest ƒ is sampled in presence of noise, comprising: (i). an input device for receiving the information in the data set {ƒ(x_(j))}; and (ii). a processor communicating to the input device and performing the steps of: a. selecting data ƒ_(j)′ from the data set {ƒ_(j)′=<ƒ,ψ_(x) _(j) >+η_(j)}, wherein η_(j) represents a corresponding noise component; b. constructing an initialization function ƒ′ as the summation of function ƒ_(j)′:ƒ′=3_(jOJ)ƒ_(j)′β_(j), wherein β_(j) represents the jth component of a partition of unity; c. constructing a quasi-interpolant operator Q_(X); d. applying the quasi-interpolant operator Q_(X) to the function ƒ′ to obtain an an approximation Q_(X)ƒ′; e. constructing a projection operator P; f. applying the projection operator P to the approximation Q_(X)f′ to obtain a first approximation ƒ₁=P Q_(X)ƒ′; g. obtaining an error e=ƒ−ƒ₁; h. constructing a quasi-reconstruction operator A_(X) for obtaining a quasi-reconstruction A_(X)ƒ wherein A_(X)ƒ=3_(jOJ)<ƒ,ψ_(x) _(j) >β_(j), and {ψ_(x) _(j) :x_(j)εX} is a set of functionals that act on ƒ(x_(j)); i. applying the projection operator P and the quasi-reconstruction operator A_(X) to the error e to obtain a first approximation of error e₁=PA_(X) e; j. obtaining a second approximation ƒ₂=ƒ₁+e₁; k. returning to step (h) until a sequence ƒ_(n)=ƒ₁+e₁+e₂+e₃+AAA+e_(n−1)=ƒ₁+(I−P A_(X))ƒ_(n−1) is obtained, wherein I is an unit operator and function ƒ_(n) converges to a function ƒ_(∞) that adequately describes the object of interest ƒ; and l. outputting the obtained sequence ƒ_(n), wherein the outputting step comprises at least one step of: (A) displaying the obtained sequence ƒ_(n) in a display with a graphic-user interface (GUI); (B) storing the obtained sequence ƒ_(n) in the computer readable medium, a memory device, or a network device; (C) transmitting the obtained sequence ƒ_(n) over network to a network device; and (D) printing the obtained sequence ƒ_(n) in a printer.
 103. The system of claim 102, wherein the processor comprises a microprocessor.
 104. The system of claim 102, wherein the input device comprises at least one device selected from the group of a processor interface, a GUI, a scanner, a CD-ROM, a diskette, a computer coupled to a network, and a networking device.
 105. The system of claim 102, further comprising an output device coupled to the processor for receiving the obtained sequence ƒ_(n).
 106. The system of claim 105, wherein the output device comprises at least one device selected from the group of a GUI, a printer, a CD-ROM, a diskette, a memory device, a computer coupled to a network, and a networking device.
 107. The system of claim 102, wherein the data set {ƒ_(j)′=<ƒ,ψ_(x) _(j) >+η_(j)} comprises a plurality of digital data related to sound.
 108. The system of claim 102, wherein the data set {ƒ_(j)′=<ƒ,ψ_(x) _(j) >+η_(j)} comprises a plurality of digital data related to at least one image.
 109. The system of claim 108, wherein the at least one image is one of a plurality of magnetic resonance image, a plurality of computerized tomography images, a plurality of optical image, a plurality of ultra sound images, a plurality of electronic images that are transmittable over a network, a plurality of satellite images, a plurality of three-dimensional images, a plurality of spectral images, a plurality of n-dimensional images with n being an integer greater than 1, or any combination of them.
 110. The system of claim 102, wherein the data set {ƒ_(j)′=<ƒ,ψ_(x) _(j) >+η_(j)} comprises a plurality of biological data.
 111. The system of claim 110, wherein the plurality of biological data contain a plurality of data from the group of a plurality of biological data related to genes, a plurality of biological data related to proteins, a plurality of biological data related to cells, a plurality of biological data related to bacteria, or a plurality of biological data related to tissues.
 112. The system of claim 102, wherein the data set {ƒ_(j)′=<ƒ,ψ_(x) _(j) >+η_(j)} comprises a plurality of data from at least one measurement of the object of the interest.
 113. The system of claim 112, wherein the at least one measurement is one of at least one astronomical measurement, at least one seismic measurement, at least one marine measurement, at least one geophysical measurement, at least one atmospheric measurement, at least one engineering measurement, at least one physical measurement, or at least one chemical measurement.
 114. The system of claim 102, wherein the data set {ƒ_(j)′=<ƒ,ψ_(x) _(j) >+η_(j)} comprises a plurality of data related to time dependent signals. 